[ Started: 2023-10-25 19:26:07 CEST ] [ liana v0.1.12 for BioC-3.18 from https://github.com/saezlab/liana@master ] [1] "Libraries: " "/home/omnipath/local/R/4.3-3.18" [3] "/home/omnipath/local/R/4.3" "/usr/lib/R/library" 'getOption("repos")' replaces Bioconductor standard repositories, see 'help("repositories", package = "BiocManager")' for details. Replacement repositories: CRAN: https://cloud.r-project.org Bioconductor version 3.18 (BiocManager 1.30.22), R 4.3.1 (2023-06-16) Old packages: 'annotate', 'AnnotationDbi', 'AnnotationHub', 'AUCell', 'basilisk', 'basilisk.utils', 'beachmat', 'Biobase', 'BiocBaseUtils', 'BiocCheck', 'BiocFileCache', 'BiocGenerics', 'BiocNeighbors', 'BiocParallel', 'BiocSingular', 'BiocStyle', 'biocViews', 'biomaRt', 'Biostrings', 'bluster', 'CARNIVAL', 'ComplexHeatmap', 'decoupleR', 'DelayedArray', 'DelayedMatrixStats', 'densvis', 'DESeq2', 'dir.expiry', 'edgeR', 'ExperimentHub', 'fgsea', 'GenomeInfoDb', 'GenomicRanges', 'graph', 'GSEABase', 'GSVA', 'HDF5Array', 'interactiveDisplayBase', 'IRanges', 'KEGGREST', 'limma', 'marray', 'MatrixGenerics', 'metapod', 'piano', 'RBGL', 'Rgraphviz', 'rhdf5', 'rhdf5filters', 'Rhdf5lib', 'S4Arrays', 'S4Vectors', 'ScaledMatrix', 'scater', 'scran', 'scuttle', 'SingleCellExperiment', 'SparseArray', 'sparseMatrixStats', 'SummarizedExperiment', 'supraHex', 'viper', 'XVector', 'zlibbioc' trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/annotate_1.80.0.tar.gz' Content type 'application/x-gzip' length 1497628 bytes (1.4 MB) ================================================== downloaded 1.4 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/AnnotationDbi_1.64.0.tar.gz' Content type 'application/x-gzip' length 4359358 bytes (4.2 MB) ================================================== downloaded 4.2 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/AnnotationHub_3.10.0.tar.gz' Content type 'application/x-gzip' length 994592 bytes (971 KB) ================================================== downloaded 971 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/AUCell_1.24.0.tar.gz' Content type 'application/x-gzip' length 1770657 bytes (1.7 MB) ================================================== downloaded 1.7 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/basilisk_1.14.0.tar.gz' Content type 'application/x-gzip' length 267309 bytes (261 KB) ================================================== downloaded 261 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/basilisk.utils_1.14.0.tar.gz' Content type 'application/x-gzip' length 240038 bytes (234 KB) ================================================== downloaded 234 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/beachmat_2.18.0.tar.gz' Content type 'application/x-gzip' length 511950 bytes (499 KB) ================================================== downloaded 499 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/Biobase_2.62.0.tar.gz' Content type 'application/x-gzip' length 1795862 bytes (1.7 MB) ================================================== downloaded 1.7 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/BiocBaseUtils_1.4.0.tar.gz' Content type 'application/x-gzip' length 227937 bytes (222 KB) ================================================== downloaded 222 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/BiocCheck_1.38.0.tar.gz' Content type 'application/x-gzip' length 4375777 bytes (4.2 MB) ================================================== downloaded 4.2 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/BiocFileCache_2.10.0.tar.gz' Content type 'application/x-gzip' length 299386 bytes (292 KB) ================================================== downloaded 292 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/BiocGenerics_0.48.0.tar.gz' Content type 'application/x-gzip' length 49252 bytes (48 KB) ================================================== downloaded 48 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/BiocNeighbors_1.20.0.tar.gz' Content type 'application/x-gzip' length 1039670 bytes (1015 KB) ================================================== downloaded 1015 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/BiocParallel_1.36.0.tar.gz' Content type 'application/x-gzip' length 997117 bytes (973 KB) ================================================== downloaded 973 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/BiocSingular_1.18.0.tar.gz' Content type 'application/x-gzip' length 616448 bytes (602 KB) ================================================== downloaded 602 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/BiocStyle_2.30.0.tar.gz' Content type 'application/x-gzip' length 787685 bytes (769 KB) ================================================== downloaded 769 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/biocViews_1.70.0.tar.gz' Content type 'application/x-gzip' length 518308 bytes (506 KB) ================================================== downloaded 506 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/biomaRt_2.58.0.tar.gz' Content type 'application/x-gzip' length 669172 bytes (653 KB) ================================================== downloaded 653 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/Biostrings_2.70.0.tar.gz' Content type 'application/x-gzip' length 12740805 bytes (12.2 MB) ================================================== downloaded 12.2 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/bluster_1.12.0.tar.gz' Content type 'application/x-gzip' length 2995786 bytes (2.9 MB) ================================================== downloaded 2.9 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/CARNIVAL_2.12.0.tar.gz' Content type 'application/x-gzip' length 2146283 bytes (2.0 MB) ================================================== downloaded 2.0 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/ComplexHeatmap_2.18.0.tar.gz' Content type 'application/x-gzip' length 1455170 bytes (1.4 MB) ================================================== downloaded 1.4 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/decoupleR_2.8.0.tar.gz' Content type 'application/x-gzip' length 4413221 bytes (4.2 MB) ================================================== downloaded 4.2 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/DelayedArray_0.28.0.tar.gz' Content type 'application/x-gzip' length 624166 bytes (609 KB) ================================================== downloaded 609 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/DelayedMatrixStats_1.24.0.tar.gz' Content type 'application/x-gzip' length 271120 bytes (264 KB) ================================================== downloaded 264 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/densvis_1.12.0.tar.gz' Content type 'application/x-gzip' length 1729962 bytes (1.6 MB) ================================================== downloaded 1.6 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/DESeq2_1.42.0.tar.gz' Content type 'application/x-gzip' length 2097442 bytes (2.0 MB) ================================================== downloaded 2.0 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/dir.expiry_1.10.0.tar.gz' Content type 'application/x-gzip' length 307918 bytes (300 KB) ================================================== downloaded 300 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/edgeR_4.0.0.tar.gz' Content type 'application/x-gzip' length 3569346 bytes (3.4 MB) ================================================== downloaded 3.4 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/ExperimentHub_2.10.0.tar.gz' Content type 'application/x-gzip' length 497004 bytes (485 KB) ================================================== downloaded 485 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/fgsea_1.28.0.tar.gz' Content type 'application/x-gzip' length 4953436 bytes (4.7 MB) ================================================== downloaded 4.7 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/GenomeInfoDb_1.38.0.tar.gz' Content type 'application/x-gzip' length 3579538 bytes (3.4 MB) ================================================== downloaded 3.4 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/GenomicRanges_1.54.0.tar.gz' Content type 'application/x-gzip' length 1139755 bytes (1.1 MB) ================================================== downloaded 1.1 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/graph_1.80.0.tar.gz' Content type 'application/x-gzip' length 1497364 bytes (1.4 MB) ================================================== downloaded 1.4 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/GSEABase_1.64.0.tar.gz' Content type 'application/x-gzip' length 299035 bytes (292 KB) ================================================== downloaded 292 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/GSVA_1.50.0.tar.gz' Content type 'application/x-gzip' length 2239026 bytes (2.1 MB) ================================================== downloaded 2.1 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/HDF5Array_1.30.0.tar.gz' Content type 'application/x-gzip' length 8098331 bytes (7.7 MB) ================================================== downloaded 7.7 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/interactiveDisplayBase_1.40.0.tar.gz' Content type 'application/x-gzip' length 7758 bytes ================================================== downloaded 7758 bytes trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/IRanges_2.36.0.tar.gz' Content type 'application/x-gzip' length 481055 bytes (469 KB) ================================================== downloaded 469 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/KEGGREST_1.42.0.tar.gz' Content type 'application/x-gzip' length 22412 bytes (21 KB) ================================================== downloaded 21 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/limma_3.58.0.tar.gz' Content type 'application/x-gzip' length 2804842 bytes (2.7 MB) ================================================== downloaded 2.7 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/marray_1.80.0.tar.gz' Content type 'application/x-gzip' length 5056102 bytes (4.8 MB) ================================================== downloaded 4.8 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/MatrixGenerics_1.14.0.tar.gz' Content type 'application/x-gzip' length 31230 bytes (30 KB) ================================================== downloaded 30 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/metapod_1.10.0.tar.gz' Content type 'application/x-gzip' length 331377 bytes (323 KB) ================================================== downloaded 323 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/piano_2.18.0.tar.gz' Content type 'application/x-gzip' length 1606094 bytes (1.5 MB) ================================================== downloaded 1.5 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/RBGL_1.78.0.tar.gz' Content type 'application/x-gzip' length 3076151 bytes (2.9 MB) ================================================== downloaded 2.9 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/Rgraphviz_2.46.0.tar.gz' Content type 'application/x-gzip' length 7395971 bytes (7.1 MB) ================================================== downloaded 7.1 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/rhdf5_2.46.0.tar.gz' Content type 'application/x-gzip' length 1273497 bytes (1.2 MB) ================================================== downloaded 1.2 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/rhdf5filters_1.14.0.tar.gz' Content type 'application/x-gzip' length 1179233 bytes (1.1 MB) ================================================== downloaded 1.1 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/Rhdf5lib_1.24.0.tar.gz' Content type 'application/x-gzip' length 12083512 bytes (11.5 MB) ================================================== downloaded 11.5 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/S4Arrays_1.2.0.tar.gz' Content type 'application/x-gzip' length 280993 bytes (274 KB) ================================================== downloaded 274 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/S4Vectors_0.40.0.tar.gz' Content type 'application/x-gzip' length 837540 bytes (817 KB) ================================================== downloaded 817 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/ScaledMatrix_1.10.0.tar.gz' Content type 'application/x-gzip' length 313034 bytes (305 KB) ================================================== downloaded 305 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/scater_1.30.0.tar.gz' Content type 'application/x-gzip' length 4123523 bytes (3.9 MB) ================================================== downloaded 3.9 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/scran_1.30.0.tar.gz' Content type 'application/x-gzip' length 1802327 bytes (1.7 MB) ================================================== downloaded 1.7 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/scuttle_1.12.0.tar.gz' Content type 'application/x-gzip' length 1029515 bytes (1005 KB) ================================================== downloaded 1005 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/SingleCellExperiment_1.24.0.tar.gz' Content type 'application/x-gzip' length 985002 bytes (961 KB) ================================================== downloaded 961 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/SparseArray_1.2.0.tar.gz' Content type 'application/x-gzip' length 366585 bytes (357 KB) ================================================== downloaded 357 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/sparseMatrixStats_1.14.0.tar.gz' Content type 'application/x-gzip' length 703089 bytes (686 KB) ================================================== downloaded 686 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/SummarizedExperiment_1.32.0.tar.gz' Content type 'application/x-gzip' length 686052 bytes (669 KB) ================================================== downloaded 669 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/supraHex_1.40.0.tar.gz' Content type 'application/x-gzip' length 5069651 bytes (4.8 MB) ================================================== downloaded 4.8 MB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/viper_1.36.0.tar.gz' Content type 'application/x-gzip' length 318999 bytes (311 KB) ================================================== downloaded 311 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/XVector_0.42.0.tar.gz' Content type 'application/x-gzip' length 67825 bytes (66 KB) ================================================== downloaded 66 KB trying URL 'https://bioconductor.org/packages/3.18/bioc/src/contrib/zlibbioc_1.48.0.tar.gz' Content type 'application/x-gzip' length 163378 bytes (159 KB) ================================================== downloaded 159 KB * installing *source* package ‘BiocBaseUtils’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (BiocBaseUtils) * installing *source* package ‘BiocFileCache’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (BiocFileCache) * installing *source* package ‘BiocGenerics’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading Creating a new generic function for ‘aperm’ in package ‘BiocGenerics’ Creating a new generic function for ‘append’ in package ‘BiocGenerics’ Creating a new generic function for ‘as.data.frame’ in package ‘BiocGenerics’ Creating a new generic function for ‘cbind’ in package ‘BiocGenerics’ Creating a new generic function for ‘rbind’ in package ‘BiocGenerics’ Creating a new generic function for ‘do.call’ in package ‘BiocGenerics’ Creating a new generic function for ‘duplicated’ in package ‘BiocGenerics’ Creating a new generic function for ‘anyDuplicated’ in package ‘BiocGenerics’ Creating a new generic function for ‘eval’ in package ‘BiocGenerics’ Creating a new generic function for ‘pmax’ in package ‘BiocGenerics’ Creating a new generic function for ‘pmin’ in package ‘BiocGenerics’ Creating a new generic function for ‘pmax.int’ in package ‘BiocGenerics’ Creating a new generic function for ‘pmin.int’ in package ‘BiocGenerics’ Creating a new generic function for ‘Reduce’ in package ‘BiocGenerics’ Creating a new generic function for ‘Filter’ in package ‘BiocGenerics’ Creating a new generic function for ‘Find’ in package ‘BiocGenerics’ Creating a new generic function for ‘Map’ in package ‘BiocGenerics’ Creating a new generic function for ‘Position’ in package ‘BiocGenerics’ Creating a new generic function for ‘get’ in package ‘BiocGenerics’ Creating a new generic function for ‘mget’ in package ‘BiocGenerics’ Creating a new generic function for ‘grep’ in package ‘BiocGenerics’ Creating a new generic function for ‘grepl’ in package ‘BiocGenerics’ Creating a new generic function for ‘is.unsorted’ in package ‘BiocGenerics’ Creating a new generic function for ‘lapply’ in package ‘BiocGenerics’ Creating a new generic function for ‘sapply’ in package ‘BiocGenerics’ Creating a new generic function for ‘mapply’ in package ‘BiocGenerics’ Creating a new generic function for ‘match’ in package ‘BiocGenerics’ Creating a new generic function for ‘order’ in package ‘BiocGenerics’ Creating a new generic function for ‘paste’ in package ‘BiocGenerics’ Creating a new generic function for ‘rank’ in package ‘BiocGenerics’ Creating a new generic function for ‘rownames’ in package ‘BiocGenerics’ Creating a new generic function for ‘colnames’ in package ‘BiocGenerics’ Creating a new generic function for ‘union’ in package ‘BiocGenerics’ Creating a new generic function for ‘intersect’ in package ‘BiocGenerics’ Creating a new generic function for ‘setdiff’ in package ‘BiocGenerics’ Creating a new generic function for ‘sort’ in package ‘BiocGenerics’ Creating a new generic function for ‘table’ in package ‘BiocGenerics’ Creating a new generic function for ‘tapply’ in package ‘BiocGenerics’ Creating a new generic function for ‘unique’ in package ‘BiocGenerics’ Creating a new generic function for ‘unsplit’ in package ‘BiocGenerics’ Creating a new generic function for ‘var’ in package ‘BiocGenerics’ Creating a new generic function for ‘sd’ in package ‘BiocGenerics’ Creating a new generic function for ‘which.min’ in package ‘BiocGenerics’ Creating a new generic function for ‘which.max’ in package ‘BiocGenerics’ Creating a new generic function for ‘IQR’ in package ‘BiocGenerics’ Creating a new generic function for ‘mad’ in package ‘BiocGenerics’ Creating a new generic function for ‘xtabs’ in package ‘BiocGenerics’ Creating a new generic function for ‘basename’ in package ‘BiocGenerics’ Creating a new generic function for ‘dirname’ in package ‘BiocGenerics’ ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (BiocGenerics) * installing *source* package ‘BiocParallel’ ... ** using staged installation checking whether the C++ compiler works... yes checking for C++ compiler default output file name... a.out checking for suffix of executables... checking whether we are cross compiling... no checking for suffix of object files... o checking whether the compiler supports GNU C++... yes checking whether g++ -std=gnu++17 accepts -g... yes checking for g++ -std=gnu++17 option to enable C++11 features... none needed checking for library containing shm_open... none required checking for stdio.h... yes checking for stdlib.h... yes checking for string.h... yes checking for inttypes.h... yes checking for stdint.h... yes checking for strings.h... yes checking for sys/stat.h... yes checking for sys/types.h... yes checking for unistd.h... yes checking for sys/mman.h... yes configure: creating ./config.status config.status: creating src/Makevars ** libs using C++ compiler: ‘g++ (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ using C++11 g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -I'/home/omnipath/local/R/4.3-3.18/cpp11/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c cpp11.cpp -o cpp11.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -I'/home/omnipath/local/R/4.3-3.18/cpp11/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c ipcmutex.cpp -o ipcmutex.o g++ -std=gnu++11 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o BiocParallel.so cpp11.o ipcmutex.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-BiocParallel/00new/BiocParallel/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (BiocParallel) * installing *source* package ‘BiocStyle’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (BiocStyle) * installing *source* package ‘CARNIVAL’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (CARNIVAL) * installing *source* package ‘decoupleR’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (decoupleR) * installing *source* package ‘dir.expiry’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (dir.expiry) * installing *source* package ‘limma’ ... ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c init.c -o init.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c normexp.c -o normexp.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c weighted_lowess.c -o weighted_lowess.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o limma.so init.o normexp.o weighted_lowess.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-limma/00new/limma/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (limma) * installing *source* package ‘MatrixGenerics’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading Creating a new generic function for ‘rowAlls’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colAlls’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowAnyNAs’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colAnyNAs’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowAnys’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colAnys’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowAvgsPerColSet’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colAvgsPerRowSet’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowCollapse’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colCollapse’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowCounts’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colCounts’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowCummaxs’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colCummaxs’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowCummins’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colCummins’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowCumprods’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colCumprods’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowCumsums’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colCumsums’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowDiffs’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colDiffs’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowIQRDiffs’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colIQRDiffs’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowIQRs’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colIQRs’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowLogSumExps’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colLogSumExps’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowMadDiffs’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colMadDiffs’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowMads’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colMads’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowMaxs’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colMaxs’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowMeans2’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colMeans2’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowMedians’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colMedians’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowMins’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colMins’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowOrderStats’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colOrderStats’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowProds’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colProds’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowQuantiles’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colQuantiles’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowRanges’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colRanges’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowRanks’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colRanks’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowSdDiffs’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colSdDiffs’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowSds’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colSds’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowSums2’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colSums2’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowTabulates’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colTabulates’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowVarDiffs’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colVarDiffs’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowVars’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colVars’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowWeightedMads’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colWeightedMads’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowWeightedMeans’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colWeightedMeans’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowWeightedMedians’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colWeightedMedians’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowWeightedSds’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colWeightedSds’ in package ‘MatrixGenerics’ Creating a new generic function for ‘rowWeightedVars’ in package ‘MatrixGenerics’ Creating a new generic function for ‘colWeightedVars’ in package ‘MatrixGenerics’ ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (MatrixGenerics) * installing *source* package ‘metapod’ ... ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ using C++11 g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c RcppExports.cpp -o RcppExports.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c combine_group.cpp -o combine_group.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c combine_parallel.cpp -o combine_parallel.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c count_direction.cpp -o count_direction.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c summarize_direction.cpp -o summarize_direction.o g++ -std=gnu++11 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o metapod.so RcppExports.o combine_group.o combine_parallel.o count_direction.o summarize_direction.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-metapod/00new/metapod/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (metapod) * installing *source* package ‘Rhdf5lib’ ... ** using staged installation checking for gcc... gcc checking whether the C compiler works... yes checking for C compiler default output file name... a.out checking for suffix of executables... checking whether we are cross compiling... no checking for suffix of object files... o checking whether the compiler supports GNU C... yes checking whether gcc accepts -g... yes checking for gcc option to enable C11 features... none needed checking whether the compiler supports GNU C++... yes checking whether g++ -std=gnu++17 accepts -g... yes checking for g++ -std=gnu++17 option to enable C++11 features... none needed COMPILER = gcc checking whether C compiler accepts -w... yes checking whether to use -Wl,-rpath setting... yes checking for stdio.h... yes checking for stdlib.h... yes checking for string.h... yes checking for inttypes.h... yes checking for stdint.h... yes checking for strings.h... yes checking for sys/stat.h... yes checking for sys/types.h... yes checking for unistd.h... yes checking for zlib.h... yes checking for szlib.h... yes checking for libaec.h... yes checking for SZ_BufftoBuffCompress in -lsz... yes checking for aec_buffer_encode in -lsz... yes checking for curl/curl.h... yes checking for openssl/evp.h... yes checking for openssl/hmac.h... yes checking for openssl/sha.h... yes checking for curl_global_init in -lcurl... yes checking for EVP_sha256 in -lcrypto... yes S3_VFD=--enable-ros3-vfd configure: creating ./config.status config.status: creating src/Makevars ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ gunzip -dc hdf5small_cxx_hl_1.10.7.tar.gz | tar xf -; cd hdf5; \ ./configure --with-pic --enable-shared=no --enable-cxx --enable-hl \ --enable-tests=no --enable-tools=no \ --with-szlib=yes --with-zlib=yes \ --enable-ros3-vfd \ --enable-sharedlib-rpath \ CC='gcc' CXX='g++ -std=gnu++17' \ CPPFLAGS='' \ CFLAGS='-g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -w -fpic' \ CXXFLAGS='-w -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic' \ AR='ar' RANLIB='ranlib' \ LDFLAGS='-Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro'; \ make lib checking for a BSD-compatible install... /usr/bin/install -c checking whether build environment is sane... yes checking for a thread-safe mkdir -p... /usr/bin/mkdir -p checking for gawk... gawk checking whether make sets $(MAKE)... yes checking whether make supports nested variables... yes checking whether make supports nested variables... (cached) yes checking whether to enable maintainer-specific portions of Makefiles... no checking build system type... x86_64-unknown-linux-gnu checking host system type... x86_64-unknown-linux-gnu checking shell variables initial values... done checking if basename works... yes checking if xargs works... yes checking for cached host... none checking for config x86_64-unknown-linux-gnu... no checking for config x86_64-unknown-linux-gnu... no checking for config unknown-linux-gnu... no checking for config unknown-linux-gnu... no checking for config x86_64-linux-gnu... no checking for config x86_64-linux-gnu... no checking for config x86_64-unknown... no checking for config linux-gnu... found compiler 'gcc' is GNU gcc-11.4.0 compiler 'gfortran' is GNU gfortran-11.4.0 compiler 'g++ -std=gnu++17' is GNU g++-11.4.0 checking for config ./config/site-specific/host-saezlab... no checking for clang sanitizer checks... checking build mode... production checking for gcc... gcc checking whether the C compiler works... yes checking for C compiler default output file name... a.out checking for suffix of executables... checking whether we are cross compiling... no checking for suffix of object files... o checking whether we are using the GNU C compiler... yes checking whether gcc accepts -g... yes checking for gcc option to accept ISO C89... none needed checking whether gcc understands -c and -o together... yes checking whether make supports the include directive... yes (GNU style) checking dependency style of gcc... gcc3 checking if unsupported combinations of configure options are allowed... no checking how to run the C preprocessor... gcc -E checking for grep that handles long lines and -e... /usr/bin/grep checking for egrep... /usr/bin/grep -E checking for ANSI C header files... yes checking for sys/types.h... yes checking for sys/stat.h... yes checking for stdlib.h... yes checking for string.h... yes checking for memory.h... yes checking for strings.h... yes checking for inttypes.h... yes checking for stdint.h... yes checking for unistd.h... yes checking for off_t... yes checking for size_t... yes checking for ssize_t... yes checking for ptrdiff_t... yes checking whether byte ordering is bigendian... no checking size of char... 1 checking size of short... 2 checking size of int... 4 checking size of unsigned... 4 checking size of long... 8 checking size of long long... 8 checking size of __int64... 0 checking size of float... 4 checking size of double... 8 checking size of long double... 16 checking size of __float128... 16 checking size of _Quad... 0 checking quadmath.h usability... yes checking quadmath.h presence... yes checking for quadmath.h... yes checking maximum decimal precision for C... 33 checking if Fortran interface enabled... no checking whether we are using the GNU C++ compiler... yes checking whether g++ -std=gnu++17 accepts -g... yes checking dependency style of g++ -std=gnu++17... gcc3 checking how to run the C++ preprocessor... g++ -std=gnu++17 -E checking if c++ interface enabled... yes checking if g++ -std=gnu++17 needs old style header files in includes... no checking if g++ -std=gnu++17 can handle namespaces... yes checking if g++ -std=gnu++17 can handle static cast... yes checking if g++ -std=gnu++17 has offsetof extension... yes checking if the high-level library is enabled... yes checking whether make sets $(MAKE)... (cached) yes checking for tr... /usr/bin/tr checking if srcdir= and time commands work together... yes checking if Java JNI interface enabled... no checking if building tests is disabled... Building HDF5 tests is disabled checking if building tools is disabled... Building HDF5 tools is disabled checking how to print strings... printf checking for a sed that does not truncate output... /bin/sed checking for fgrep... /usr/bin/grep -F checking for ld used by gcc... /usr/bin/ld checking if the linker (/usr/bin/ld) is GNU ld... yes checking for BSD- or MS-compatible name lister (nm)... /usr/bin/nm -B checking the name lister (/usr/bin/nm -B) interface... BSD nm checking whether ln -s works... yes checking the maximum length of command line arguments... 1572864 checking how to convert x86_64-unknown-linux-gnu file names to x86_64-unknown-linux-gnu format... func_convert_file_noop checking how to convert x86_64-unknown-linux-gnu file names to toolchain format... func_convert_file_noop checking for /usr/bin/ld option to reload object files... -r checking for objdump... objdump checking how to recognize dependent libraries... pass_all checking for dlltool... no checking how to associate runtime and link libraries... printf %s\n checking for archiver @FILE support... @ checking for strip... strip checking for ranlib... ranlib checking command to parse /usr/bin/nm -B output from gcc object... ok checking for sysroot... no checking for a working dd... /usr/bin/dd checking how to truncate binary pipes... /usr/bin/dd bs=4096 count=1 checking for mt... mt checking if mt is a manifest tool... no checking for dlfcn.h... yes checking for objdir... .libs checking if gcc supports -fno-rtti -fno-exceptions... yes checking for gcc option to produce PIC... -fPIC -DPIC checking if gcc PIC flag -fPIC -DPIC works... yes checking if gcc static flag -static works... yes checking if gcc supports -c -o file.o... yes checking if gcc supports -c -o file.o... (cached) yes checking whether the gcc linker (/usr/bin/ld -m elf_x86_64) supports shared libraries... yes checking dynamic linker characteristics... GNU/Linux ld.so checking how to hardcode library paths into programs... immediate checking for shl_load... no checking for shl_load in -ldld... no checking for dlopen... yes checking whether a program can dlopen itself... yes checking whether a statically linked program can dlopen itself... no checking whether stripping libraries is possible... yes checking if libtool supports shared libraries... yes checking whether to build shared libraries... no checking whether to build static libraries... yes checking how to run the C++ preprocessor... g++ -std=gnu++17 -E checking for ld used by g++ -std=gnu++17... /usr/bin/ld -m elf_x86_64 checking if the linker (/usr/bin/ld -m elf_x86_64) is GNU ld... yes checking whether the g++ -std=gnu++17 linker (/usr/bin/ld -m elf_x86_64) supports shared libraries... yes checking for g++ -std=gnu++17 option to produce PIC... -fPIC -DPIC checking if g++ -std=gnu++17 PIC flag -fPIC -DPIC works... yes checking if g++ -std=gnu++17 static flag -static works... yes checking if g++ -std=gnu++17 supports -c -o file.o... yes checking if g++ -std=gnu++17 supports -c -o file.o... (cached) yes checking whether the g++ -std=gnu++17 linker (/usr/bin/ld -m elf_x86_64) supports shared libraries... yes checking dynamic linker characteristics... (cached) GNU/Linux ld.so checking how to hardcode library paths into programs... immediate checking if we should install only statically linked executables... no checking if -Wl,-rpath should be used to link shared libs in nondefault directories... yes checking for ceil in -lm... yes checking for dlopen in -ldl... yes checking for ANSI C header files... (cached) yes checking whether time.h and sys/time.h may both be included... yes checking sys/resource.h usability... yes checking sys/resource.h presence... yes checking for sys/resource.h... yes checking sys/time.h usability... yes checking sys/time.h presence... yes checking for sys/time.h... yes checking for unistd.h... (cached) yes checking sys/ioctl.h usability... yes checking sys/ioctl.h presence... yes checking for sys/ioctl.h... yes checking for sys/stat.h... (cached) yes checking sys/socket.h usability... yes checking sys/socket.h presence... yes checking for sys/socket.h... yes checking for sys/types.h... (cached) yes checking sys/file.h usability... yes checking sys/file.h presence... yes checking for sys/file.h... yes checking stddef.h usability... yes checking stddef.h presence... yes checking for stddef.h... yes checking setjmp.h usability... yes checking setjmp.h presence... yes checking for setjmp.h... yes checking features.h usability... yes checking features.h presence... yes checking for features.h... yes checking dirent.h usability... yes checking dirent.h presence... yes checking for dirent.h... yes checking for stdint.h... (cached) yes checking stdbool.h usability... yes checking stdbool.h presence... yes checking for stdbool.h... yes checking netdb.h usability... yes checking netdb.h presence... yes checking for netdb.h... yes checking netinet/in.h usability... yes checking netinet/in.h presence... yes checking for netinet/in.h... yes checking arpa/inet.h usability... yes checking arpa/inet.h presence... yes checking for arpa/inet.h... yes checking io.h usability... no checking io.h presence... no checking for io.h... no checking winsock2.h usability... no checking winsock2.h presence... no checking for winsock2.h... no checking sys/timeb.h usability... yes checking sys/timeb.h presence... yes checking for sys/timeb.h... yes checking for _FILE_OFFSET_BITS value needed for large files... no checking size of int8_t... 1 checking size of uint8_t... 1 checking size of int_least8_t... 1 checking size of uint_least8_t... 1 checking size of int_fast8_t... 1 checking size of uint_fast8_t... 1 checking size of int16_t... 2 checking size of uint16_t... 2 checking size of int_least16_t... 2 checking size of uint_least16_t... 2 checking size of int_fast16_t... 8 checking size of uint_fast16_t... 8 checking size of int32_t... 4 checking size of uint32_t... 4 checking size of int_least32_t... 4 checking size of uint_least32_t... 4 checking size of int_fast32_t... 8 checking size of uint_fast32_t... 8 checking size of int64_t... 8 checking size of uint64_t... 8 checking size of int_least64_t... 8 checking size of uint_least64_t... 8 checking size of int_fast64_t... 8 checking size of uint_fast64_t... 8 checking size of size_t... 8 checking size of ssize_t... 8 checking size of ptrdiff_t... 8 checking size of off_t... 8 checking size of bool... 1 checking size of time_t... 8 checking if dev_t is scalar... yes checking for dmalloc library... suppressed checking zlib.h usability... yes checking zlib.h presence... yes checking for zlib.h... yes checking for compress2 in -lz... yes checking for compress2... yes checking szlib.h usability... yes checking szlib.h presence... yes checking for szlib.h... yes checking libaec.h usability... yes checking libaec.h presence... yes checking for libaec.h... yes checking for aec_encode in -laec... yes checking for SZ_BufftoBuffCompress in -lsz... yes checking for szlib encoder... yes checking for thread safe support... no checking whether CLOCK_MONOTONIC is declared... yes checking for tm_gmtoff in struct tm... yes checking for global timezone variable... yes checking for st_blocks in struct stat... no checking for _getvideoconfig... no checking for gettextinfo... no checking for GetConsoleScreenBufferInfo... no checking for getpwuid... yes checking for _scrsize... no checking for ioctl... yes checking for struct videoconfig... no checking for struct text_info... no checking for TIOCGWINSZ... yes checking for TIOCGETD... yes checking for library containing clock_gettime... none required checking for alarm... yes checking for clock_gettime... yes checking for difftime... yes checking for fcntl... yes checking for flock... yes checking for fork... yes checking for frexpf... yes checking for frexpl... yes checking for gethostname... yes checking for getrusage... yes checking for gettimeofday... yes checking for lstat... yes checking for rand_r... yes checking for random... yes checking for setsysinfo... no checking for signal... yes checking for longjmp... yes checking for setjmp... yes checking for siglongjmp... yes checking for sigsetjmp... no checking for sigprocmask... yes checking for snprintf... yes checking for srandom... yes checking for strdup... yes checking for symlink... yes checking for system... yes checking for strtoll... yes checking for strtoull... yes checking for tmpfile... yes checking for asprintf... yes checking for vasprintf... yes checking for vsnprintf... yes checking for waitpid... yes checking for roundf... yes checking for lroundf... yes checking for llroundf... yes checking for round... yes checking for lround... yes checking for llround... yes checking for an ANSI C-conforming const... yes checking if the compiler understands __inline__... yes checking if the compiler understands __inline... yes checking if the compiler understands inline... yes checking for __attribute__ extension... yes checking for __func__ extension... yes checking for __FUNCTION__ extension... yes checking for C99 designated initialization support... yes checking how to print long long... %ld and %lu checking enable debugging symbols... no checking enable asserts... no checking enable developer warnings... no checking profiling... no checking optimization level... high checking enable file locking... best-effort checking for internal debug output... none checking whether function stack tracking is enabled... no checking for API tracing... no checking whether a memory checking tool will be used... no checking whether internal memory allocation sanity checking is used... no checking for parallel support files... skipped checking whether O_DIRECT is declared... yes checking for posix_memalign... yes checking if the direct I/O virtual file driver (VFD) is enabled... no checking if the Mirror virtual file driver (VFD) is enabled... no checking curl/curl.h usability... yes checking curl/curl.h presence... yes checking for curl/curl.h... yes checking openssl/evp.h usability... yes checking openssl/evp.h presence... yes checking for openssl/evp.h... yes checking openssl/hmac.h usability... yes checking openssl/hmac.h presence... yes checking for openssl/hmac.h... yes checking openssl/sha.h usability... yes checking openssl/sha.h presence... yes checking for openssl/sha.h... yes checking for curl_global_init in -lcurl... yes checking for EVP_sha256 in -lcrypto... yes checking if the Read-Only S3 virtual file driver (VFD) is enabled... yes checking for libhdfs... suppressed checking for custom examples path definition... ${prefix}/share/hdf5_examples checking for custom plugin default path definition... /usr/local/hdf5/lib/plugin checking whether exception handling functions is checked during data conversions... yes checking whether data accuracy is guaranteed during data conversions... yes checking if the machine has window style path name... no checking if using special algorithm to convert long double to (unsigned) long values... no checking if using special algorithm to convert (unsigned) long to long double values... no checking if correctly converting long double to (unsigned) long long values... yes checking if correctly converting (unsigned) long long to long double values... yes checking if the system is IBM ppc64le and cannot correctly convert some long double values... no checking additional programs should be built... no checking if deprecated public symbols are available... yes checking which version of public symbols to use by default... v110 checking whether to perform strict file format checks... no checking for pread... yes checking for pwrite... yes checking whether to use pread/pwrite instead of read/write in certain VFDs... yes checking whether to have library information embedded in the executables... yes checking if alignment restrictions are strictly enforced... no configure: creating ./config.lt config.lt: creating libtool checking that generated files are newer than configure... done configure: creating ./config.status config.status: creating src/libhdf5.settings config.status: creating Makefile config.status: creating src/Makefile config.status: creating utils/Makefile config.status: creating utils/mirror_vfd/Makefile config.status: creating bin/h5cc config.status: creating bin/Makefile config.status: creating c++/Makefile config.status: creating c++/src/Makefile config.status: creating c++/src/h5c++ config.status: creating hl/Makefile config.status: creating hl/src/Makefile config.status: creating hl/c++/Makefile config.status: creating hl/c++/src/Makefile config.status: creating src/H5config.h config.status: executing pubconf commands creating src/H5pubconf.h Post process src/libhdf5.settings config.status: executing depfiles commands config.status: executing libtool commands config.status: executing .classes commands SUMMARY OF THE HDF5 CONFIGURATION ================================= General Information: ------------------- HDF5 Version: 1.10.7 Configured on: Wed Oct 25 19:28:24 CEST 2023 Configured by: omnipath@saezlab Host system: x86_64-unknown-linux-gnu Uname information: Linux saezlab 6.0.0-1008-oem #8-Ubuntu SMP PREEMPT_DYNAMIC Wed Nov 16 17:31:27 UTC 2022 x86_64 x86_64 x86_64 GNU/Linux Byte sex: little-endian Installation point: /tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/hdf5 Compiling Options: ------------------ Build Mode: production Debugging Symbols: no Asserts: no Profiling: no Optimization Level: high Linking Options: ---------------- Libraries: static Statically Linked Executables: LDFLAGS: -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro H5_LDFLAGS: AM_LDFLAGS: Extra libraries: -lcrypto -lcurl -lsz -laec -lz -ldl -lm Archiver: ar AR_FLAGS: cr Ranlib: ranlib Languages: ---------- C: yes C Compiler: /usr/bin/gcc CPPFLAGS: H5_CPPFLAGS: -D_GNU_SOURCE -D_POSIX_C_SOURCE=200809L -DNDEBUG -UH5_DEBUG_API AM_CPPFLAGS: C Flags: -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -w -fpic H5 C Flags: -std=c99 -Wno-c++-compat -Wno-format-nonliteral -Wshadow -Wundef -Wwrite-strings -Wlarger-than=2560 -Wlogical-op -Wframe-larger-than=16384 -Wpacked-bitfield-compat -Wsync-nand -Wdouble-promotion -Wtrampolines -Wstack-usage=8192 -Wmaybe-uninitialized -Wdate-time -Warray-bounds=2 -Wc99-c11-compat -Wduplicated-cond -Whsa -Wnormalized -Wunused-const-variable -Walloca -Walloc-zero -Wduplicated-branches -Wimplicit-fallthrough=5 -Wrestrict -Wattribute-alias -Wshift-overflow=2 -Wattribute-alias=2 -Wmissing-profile -fstdarg-opt -s -Wno-aggregate-return -Wno-inline -Wno-missing-format-attribute -Wno-missing-noreturn -Wno-overlength-strings -Wno-jump-misses-init -Wno-suggest-attribute=const -Wno-suggest-attribute=noreturn -Wno-suggest-attribute=pure -Wno-suggest-attribute=format -Wno-suggest-attribute=cold -Wno-suggest-attribute=malloc -O3 -Werror=bad-function-cast -Werror=declaration-after-statement -Werror=implicit-function-declaration -Werror=missing-declarations -Werror=missing-prototypes -Werror=nested-externs -Werror=old-style-definition -Werror=packed -Werror=pointer-sign -Werror=pointer-to-int-cast -Werror=redundant-decls -Werror=strict-prototypes -Werror=switch -Wunused-function -Wformat -Werror=incompatible-pointer-types -Werror=shadow -Wcast-function-type -Wmaybe-uninitialized AM C Flags: Shared C Library: no Static C Library: yes Fortran: no C++: yes C++ Compiler: /usr/bin/g++ -std=gnu++17 C++ Flags: -w -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic H5 C++ Flags: -Wall -Wconversion -Wctor-dtor-privacy -Wextra -Wfloat-equal -Wformat=2 -Winit-self -Winvalid-pch -Wmissing-include-dirs -Wno-format-nonliteral -Wnon-virtual-dtor -Woverloaded-virtual -Wreorder -Wshadow -Wsign-promo -Wundef -Wwrite-strings -pedantic -Wlarger-than=2560 -Wlogical-op -Wframe-larger-than=16384 -Wpacked-bitfield-compat -Wsync-nand -Wdouble-promotion -Wtrampolines -Wstack-usage=8192 -Wmaybe-uninitialized -Wdate-time -Wopenmp-simd -Warray-bounds=2 -Wduplicated-cond -Whsa -Wnormalized -Wunused-const-variable -Walloca -Walloc-zero -Wduplicated-branches -Wimplicit-fallthrough=5 -Wrestrict -Wattribute-alias -Wshift-overflow=2 -Wattribute-alias=2 -Wmissing-profile -fstdarg-opt -s -O3 -Wcast-align -Wmissing-declarations -Werror=packed -Werror=redundant-decls -Werror=switch -Wunused-but-set-variable -Werror=unused-function -Werror=unused-variable -Wunused-parameter -Werror=shadow AM C++ Flags: Shared C++ Library: no Static C++ Library: yes Java: no Features: --------- Parallel HDF5: no Parallel Filtered Dataset Writes: no Large Parallel I/O: no High-level library: yes Build HDF5 Tests: no Build HDF5 Tools: no Threadsafety: no Default API mapping: v110 With deprecated public symbols: yes I/O filters (external): deflate(zlib),szip(encoder) MPE: no Direct VFD: no Mirror VFD: no (Read-Only) S3 VFD: yes (Read-Only) HDFS VFD: no dmalloc: no Packages w/ extra debug output: none API tracing: no Using memory checker: no Memory allocation sanity checks: no Function stack tracing: no Use file locking: best-effort Strict file format checks: no Optimization instrumentation: no make[1]: Entering directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5' for d in src . c++ hl; do \ if test $d != .; then \ (cd $d && make lib) || exit 1; \ fi; \ done make[2]: Entering directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/src' make[3]: Entering directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/src' CC H5.lo CC H5checksum.lo CC H5dbg.lo CC H5system.lo CC H5timer.lo CC H5trace.lo CC H5A.lo CC H5Abtree2.lo CC H5Adense.lo CC H5Adeprec.lo CC H5Aint.lo CC H5Atest.lo CC H5AC.lo CC H5ACdbg.lo CC H5ACproxy_entry.lo CC H5B.lo CC H5Bcache.lo CC H5Bdbg.lo CC H5B2.lo CC H5B2cache.lo CC H5B2dbg.lo CC H5B2hdr.lo CC H5B2int.lo CC H5B2internal.lo CC H5B2leaf.lo CC H5B2stat.lo CC H5B2test.lo CC H5C.lo CC H5Cdbg.lo CC H5Cepoch.lo CC H5Cimage.lo CC H5Clog.lo CC H5Clog_json.lo CC H5Clog_trace.lo CC H5Cprefetched.lo CC H5Cquery.lo CC H5Ctag.lo CC H5Ctest.lo CC H5CS.lo CC H5CX.lo CC H5D.lo CC H5Dbtree.lo CC H5Dbtree2.lo CC H5Dchunk.lo CC H5Dcompact.lo CC H5Dcontig.lo CC H5Ddbg.lo CC H5Ddeprec.lo CC H5Dearray.lo CC H5Defl.lo CC H5Dfarray.lo CC H5Dfill.lo CC H5Dint.lo CC H5Dio.lo CC H5Dlayout.lo CC H5Dnone.lo CC H5Doh.lo CC H5Dscatgath.lo CC H5Dselect.lo CC H5Dsingle.lo CC H5Dtest.lo CC H5Dvirtual.lo CC H5E.lo CC H5Edeprec.lo CC H5Eint.lo CC H5EA.lo CC H5EAcache.lo CC H5EAdbg.lo CC H5EAdblkpage.lo CC H5EAdblock.lo CC H5EAhdr.lo CC H5EAiblock.lo CC H5EAint.lo CC H5EAsblock.lo CC H5EAstat.lo CC H5EAtest.lo CC H5F.lo CC H5Faccum.lo CC H5Fcwfs.lo CC H5Fdbg.lo CC H5Fdeprec.lo CC H5Fefc.lo CC H5Ffake.lo CC H5Fint.lo CC H5Fio.lo CC H5Fmount.lo CC H5Fquery.lo CC H5Fsfile.lo CC H5Fspace.lo CC H5Fsuper.lo CC H5Fsuper_cache.lo CC H5Ftest.lo CC H5FA.lo CC H5FAcache.lo CC H5FAdbg.lo CC H5FAdblock.lo CC H5FAdblkpage.lo CC H5FAhdr.lo CC H5FAint.lo CC H5FAstat.lo CC H5FAtest.lo CC H5FD.lo CC H5FDcore.lo CC H5FDfamily.lo CC H5FDhdfs.lo CC H5FDint.lo CC H5FDlog.lo CC H5FDmulti.lo CC H5FDsec2.lo CC H5FDspace.lo CC H5FDsplitter.lo CC H5FDstdio.lo CC H5FDtest.lo CC H5FL.lo CC H5FO.lo CC H5FS.lo CC H5FScache.lo CC H5FSdbg.lo CC H5FSint.lo CC H5FSsection.lo CC H5FSstat.lo CC H5FStest.lo CC H5G.lo CC H5Gbtree2.lo CC H5Gcache.lo CC H5Gcompact.lo CC H5Gdense.lo CC H5Gdeprec.lo CC H5Gent.lo CC H5Gint.lo CC H5Glink.lo CC H5Gloc.lo CC H5Gname.lo CC H5Gnode.lo CC H5Gobj.lo CC H5Goh.lo CC H5Groot.lo CC H5Gstab.lo CC H5Gtest.lo CC H5Gtraverse.lo CC H5HF.lo CC H5HFbtree2.lo CC H5HFcache.lo CC H5HFdbg.lo CC H5HFdblock.lo CC H5HFdtable.lo CC H5HFhdr.lo CC H5HFhuge.lo CC H5HFiblock.lo CC H5HFiter.lo CC H5HFman.lo CC H5HFsection.lo CC H5HFspace.lo CC H5HFstat.lo CC H5HFtest.lo CC H5HFtiny.lo CC H5HG.lo CC H5HGcache.lo CC H5HGdbg.lo CC H5HGquery.lo CC H5HL.lo CC H5HLcache.lo CC H5HLdbg.lo CC H5HLint.lo CC H5HLprfx.lo CC H5HLdblk.lo CC H5HP.lo CC H5I.lo CC H5Itest.lo CC H5L.lo CC H5Lexternal.lo CC H5make_libsettings.o CCLD H5make_libsettings LD_LIBRARY_PATH="$LD_LIBRARY_PATH`echo -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro | \ sed -e 's/-L/:/g' -e 's/ //g'`" \ ./H5make_libsettings > H5lib_settings.c || \ (test $HDF5_Make_Ignore && echo "*** Error ignored") || \ (rm -f H5lib_settings.c ; exit 1) CC H5lib_settings.lo CC H5MF.lo CC H5MFaggr.lo CC H5MFdbg.lo CC H5MFsection.lo CC H5MM.lo CC H5MP.lo CC H5MPtest.lo CC H5O.lo CC H5Odeprec.lo CC H5Oainfo.lo CC H5Oalloc.lo CC H5Oattr.lo CC H5Oattribute.lo CC H5Obogus.lo CC H5Obtreek.lo CC H5Ocache.lo CC H5Ocache_image.lo CC H5Ochunk.lo CC H5Ocont.lo CC H5Ocopy.lo CC H5Odbg.lo CC H5Odrvinfo.lo CC H5Odtype.lo CC H5Oefl.lo CC H5Ofill.lo CC H5Oflush.lo CC H5Ofsinfo.lo CC H5Oginfo.lo CC H5Oint.lo CC H5Olayout.lo CC H5Olinfo.lo CC H5Olink.lo CC H5Omessage.lo CC H5Omtime.lo CC H5Oname.lo CC H5Onull.lo CC H5Opline.lo CC H5Orefcount.lo CC H5Osdspace.lo CC H5Oshared.lo CC H5Oshmesg.lo CC H5Ostab.lo CC H5Otest.lo CC H5Ounknown.lo CC H5P.lo CC H5Pacpl.lo CC H5Pdapl.lo CC H5Pdcpl.lo CC H5Pdeprec.lo CC H5Pdxpl.lo CC H5Pencdec.lo CC H5Pfapl.lo CC H5Pfcpl.lo CC H5Pfmpl.lo CC H5Pgcpl.lo CC H5Pint.lo CC H5Plapl.lo CC H5Plcpl.lo CC H5Pocpl.lo CC H5Pocpypl.lo CC H5Pstrcpl.lo CC H5Ptest.lo CC H5PB.lo CC H5PL.lo CC H5PLint.lo CC H5PLpath.lo CC H5PLplugin_cache.lo CC H5R.lo CC H5Rint.lo CC H5Rdeprec.lo CC H5UC.lo CC H5RS.lo CC H5S.lo CC H5Sall.lo CC H5Sdbg.lo CC H5Shyper.lo CC H5Snone.lo CC H5Spoint.lo CC H5Sselect.lo CC H5Stest.lo CC H5SL.lo CC H5SM.lo CC H5SMbtree2.lo CC H5SMcache.lo CC H5SMmessage.lo CC H5SMtest.lo CC H5ST.lo CC H5T.lo CC H5Tarray.lo CC H5Tbit.lo CC H5Tcommit.lo CC H5Tcompound.lo CC H5Tconv.lo CC H5Tcset.lo CC H5Tdbg.lo CC H5Tdeprec.lo CC H5Tenum.lo CC H5Tfields.lo CC H5Tfixed.lo CC H5Tfloat.lo CC H5detect.o CCLD H5detect LD_LIBRARY_PATH="$LD_LIBRARY_PATH`echo -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro | \ sed -e 's/-L/:/g' -e 's/ //g'`" \ ./H5detect > H5Tinit.c || \ (test $HDF5_Make_Ignore && echo "*** Error ignored") || \ (rm -f H5Tinit.c ; exit 1) CC H5Tinit.lo CC H5Tnative.lo CC H5Toffset.lo CC H5Toh.lo CC H5Topaque.lo CC H5Torder.lo CC H5Tpad.lo CC H5Tprecis.lo CC H5Tstrpad.lo CC H5Tvisit.lo CC H5Tvlen.lo CC H5TS.lo CC H5VM.lo CC H5WB.lo CC H5Z.lo CC H5Zdeflate.lo CC H5Zfletcher32.lo CC H5Znbit.lo CC H5Zshuffle.lo CC H5Zscaleoffset.lo CC H5Zszip.lo CC H5Ztrans.lo CC H5FDros3.lo CC H5FDs3comms.lo CCLD libhdf5.la make[3]: Leaving directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/src' make[2]: Leaving directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/src' make[2]: Entering directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/c++' make[3]: Entering directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/c++' make[3]: Nothing to be done for 'build-lib'. make[3]: Leaving directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/c++' + cd src + make lib make[3]: Entering directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/c++/src' make[4]: Entering directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/c++/src' CXX H5Exception.lo CXX H5IdComponent.lo CXX H5DataSpace.lo CXX H5PropList.lo CXX H5Library.lo CXX H5FaccProp.lo CXX H5FcreatProp.lo CXX H5LcreatProp.lo CXX H5LaccProp.lo CXX H5DaccProp.lo CXX H5DxferProp.lo CXX H5DcreatProp.lo CXX H5Location.lo CXX H5AbstractDs.lo CXX H5Attribute.lo CXX H5Object.lo CXX H5OcreatProp.lo CXX H5DataType.lo CXX H5AtomType.lo CXX H5PredType.lo CXX H5EnumType.lo CXX H5IntType.lo CXX H5FloatType.lo CXX H5StrType.lo CXX H5ArrayType.lo CXX H5VarLenType.lo CXX H5CompType.lo CXX H5DataSet.lo CXX H5CommonFG.lo CXX H5Group.lo CXX H5File.lo CXXLD libhdf5_cpp.la make[4]: Leaving directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/c++/src' make[3]: Leaving directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/c++/src' make[2]: Leaving directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/c++' make[2]: Entering directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/hl' make[3]: Entering directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/hl' make[3]: Nothing to be done for 'build-lib'. make[3]: Leaving directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/hl' + cd src + make lib make[3]: Entering directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/hl/src' make[4]: Entering directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/hl/src' CC H5DO.lo CC H5DS.lo CC H5IM.lo CC H5LT.lo CC H5LTanalyze.lo CC H5LTparse.lo CC H5PT.lo CC H5TB.lo CC H5LD.lo CCLD libhdf5_hl.la make[4]: Leaving directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/hl/src' make[3]: Leaving directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/hl/src' + cd c++ + make lib make[3]: Entering directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/hl/c++' make[4]: Entering directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/hl/c++' make[4]: Nothing to be done for 'build-lib'. make[4]: Leaving directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/hl/c++' + cd src + make lib make[4]: Entering directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/hl/c++/src' make[5]: Entering directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/hl/c++/src' CXX H5PacketTable.lo CXXLD libhdf5_hl_cpp.la make[5]: Leaving directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/hl/c++/src' make[4]: Leaving directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/hl/c++/src' make[3]: Leaving directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/hl/c++' make[2]: Leaving directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5/hl' make[1]: Leaving directory '/tmp/RtmpPYXqfa/R.INSTALL350d36512ce084/Rhdf5lib/src/hdf5' mkdir -p "/home/omnipath/local/R/4.3-3.18/00LOCK-Rhdf5lib/00new/Rhdf5lib/include" cp "hdf5/src"/*.h "/home/omnipath/local/R/4.3-3.18/00LOCK-Rhdf5lib/00new/Rhdf5lib/include" cp "hdf5/c++/src"/*.h "/home/omnipath/local/R/4.3-3.18/00LOCK-Rhdf5lib/00new/Rhdf5lib/include" cp "hdf5/hl/src"/*.h "/home/omnipath/local/R/4.3-3.18/00LOCK-Rhdf5lib/00new/Rhdf5lib/include" cp "hdf5/hl/c++/src"/*.h "/home/omnipath/local/R/4.3-3.18/00LOCK-Rhdf5lib/00new/Rhdf5lib/include" cp "hdf5/src"/libhdf5.settings "/home/omnipath/local/R/4.3-3.18/00LOCK-Rhdf5lib/00new/Rhdf5lib/include" mkdir -p "/home/omnipath/local/R/4.3-3.18/00LOCK-Rhdf5lib/00new/Rhdf5lib/lib/" cp "hdf5/src/.libs/libhdf5.a" "/home/omnipath/local/R/4.3-3.18/00LOCK-Rhdf5lib/00new/Rhdf5lib/lib/" cp "hdf5/c++/src/.libs/libhdf5_cpp.a" "/home/omnipath/local/R/4.3-3.18/00LOCK-Rhdf5lib/00new/Rhdf5lib/lib/" cp "hdf5/hl/src/.libs/libhdf5_hl.a" "/home/omnipath/local/R/4.3-3.18/00LOCK-Rhdf5lib/00new/Rhdf5lib/lib/" cp "hdf5/hl/c++/src/.libs/libhdf5_hl_cpp.a" "/home/omnipath/local/R/4.3-3.18/00LOCK-Rhdf5lib/00new/Rhdf5lib/lib/" gcc -I"/usr/share/R/include" -DNDEBUG -I"/home/omnipath/local/R/4.3-3.18/00LOCK-Rhdf5lib/00new/Rhdf5lib/include" -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c Rhdf5lib.c -o Rhdf5lib.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o Rhdf5lib.so Rhdf5lib.o /home/omnipath/local/R/4.3-3.18/00LOCK-Rhdf5lib/00new/Rhdf5lib/lib/libhdf5.a -lsz -laec -lz -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-Rhdf5lib/00new/Rhdf5lib/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (Rhdf5lib) * installing *source* package ‘supraHex’ ... ** using staged installation ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (supraHex) * installing *source* package ‘zlibbioc’ ... ** using staged installation configure: creating ./config.status config.status: creating src/Makevars ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ mkdir -p "/home/omnipath/local/R/4.3-3.18/00LOCK-zlibbioc/00new/zlibbioc/include" gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_init_zlibbioc.c -o R_init_zlibbioc.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o zlibbioc.so R_init_zlibbioc.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-zlibbioc/00new/zlibbioc/libs ** R ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (zlibbioc) * installing *source* package ‘basilisk.utils’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (basilisk.utils) * installing *source* package ‘Biobase’ ... ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c Rinit.c -o Rinit.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c anyMissing.c -o anyMissing.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c envir.c -o envir.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c matchpt.c -o matchpt.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c rowMedians.c -o rowMedians.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c sublist_extract.c -o sublist_extract.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o Biobase.so Rinit.o anyMissing.o envir.o matchpt.o rowMedians.o sublist_extract.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-Biobase/00new/Biobase/libs ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (Biobase) * installing *source* package ‘edgeR’ ... ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ using C++ compiler: ‘g++ (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_add_prior_count.cpp -o R_add_prior_count.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_ave_log_cpm.cpp -o R_ave_log_cpm.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_calculate_cpm.cpp -o R_calculate_cpm.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_check_poisson_bound.cpp -o R_check_poisson_bound.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_compute_apl.cpp -o R_compute_apl.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_compute_nbdev.cpp -o R_compute_nbdev.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_exact_test_by_deviance.cpp -o R_exact_test_by_deviance.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_fit_levenberg.cpp -o R_fit_levenberg.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_fit_one_group.cpp -o R_fit_one_group.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_get_one_way_fitted.cpp -o R_get_one_way_fitted.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_initialize_levenberg.cpp -o R_initialize_levenberg.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_loess_by_col.cpp -o R_loess_by_col.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_maximize_interpolant.cpp -o R_maximize_interpolant.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_process_hairpin_reads.c -o R_process_hairpin_reads.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_ql_glm.c -o R_ql_glm.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_simple_good_turing.cpp -o R_simple_good_turing.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c add_prior.cpp -o add_prior.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c adj_coxreid.cpp -o adj_coxreid.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c fmm_spline.c -o fmm_spline.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c glm_levenberg.cpp -o glm_levenberg.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c glm_one_group.cpp -o glm_one_group.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c init.cpp -o init.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c interpolator.cpp -o interpolator.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c nbdev.c -o nbdev.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c objects.cpp -o objects.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c ql_glm.c -o ql_glm.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c ql_weights.c -o ql_weights.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c qr_hat.c -o qr_hat.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o edgeR.so R_add_prior_count.o R_ave_log_cpm.o R_calculate_cpm.o R_check_poisson_bound.o R_compute_apl.o R_compute_nbdev.o R_exact_test_by_deviance.o R_fit_levenberg.o R_fit_one_group.o R_get_one_way_fitted.o R_initialize_levenberg.o R_loess_by_col.o R_maximize_interpolant.o R_process_hairpin_reads.o R_ql_glm.o R_simple_good_turing.o add_prior.o adj_coxreid.o fmm_spline.o glm_levenberg.o glm_one_group.o init.o interpolator.o nbdev.o objects.o ql_glm.o ql_weights.o qr_hat.o -llapack -lblas -lgfortran -lm -lquadmath -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-edgeR/00new/edgeR/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (edgeR) * installing *source* package ‘fgsea’ ... ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ using C++11 g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c RcppExports.cpp -o RcppExports.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c ScoreCalculation.cpp -o ScoreCalculation.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c ScoreRuler.cpp -o ScoreRuler.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c esCalculation.cpp -o esCalculation.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c fastGSEA.cpp -o fastGSEA.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c fgseaMultilevel.cpp -o fgseaMultilevel.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c fgseaMultilevelSupplement.cpp -o fgseaMultilevelSupplement.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c geseca.cpp -o geseca.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c util.cpp -o util.o g++ -std=gnu++11 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o fgsea.so RcppExports.o ScoreCalculation.o ScoreRuler.o esCalculation.o fastGSEA.o fgseaMultilevel.o fgseaMultilevelSupplement.o geseca.o util.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-fgsea/00new/fgsea/libs ** R ** data *** moving datasets to lazyload DB ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (fgsea) * installing *source* package ‘graph’ ... ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c graph.c -o graph.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o graph.so graph.o -L/usr/lib/R/lib -lR mv graph.so BioC_graph.so installing to /home/omnipath/local/R/4.3-3.18/00LOCK-graph/00new/graph/libs ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (graph) * installing *source* package ‘interactiveDisplayBase’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (interactiveDisplayBase) * installing *source* package ‘marray’ ... ** using staged installation ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (marray) * installing *source* package ‘rhdf5filters’ ... ** using staged installation checking for gcc... gcc checking whether the C compiler works... yes checking for C compiler default output file name... a.out checking for suffix of executables... checking whether we are cross compiling... no checking for suffix of object files... o checking whether the compiler supports GNU C... yes checking whether gcc accepts -g... yes checking for gcc option to enable C11 features... none needed configure: is NOT Bioc build machine configure: configuring BZIP2 filter... checking for stdio.h... yes checking for stdlib.h... yes checking for string.h... yes checking for inttypes.h... yes checking for stdint.h... yes checking for strings.h... yes checking for sys/stat.h... yes checking for sys/types.h... yes checking for unistd.h... yes checking for bzlib.h... yes checking for BZ2_bzDecompressInit in -lbz2... yes configure: Using system bzip2 library configure: configuring the Zstd filter... checking for zstd.h... yes checking for ZSTD_decompress in -lzstd... yes configure: Using system Zstd library configure: configuring the BLOSC filter... checking for blosc.h... yes checking for blosc_compress in -lblosc... yes configure: Using system BLOSC library configure: configuring the VBZ filter checking whether C compiler accepts -mavx... yes checking for x86 avx instruction support... yes configure: creating ./config.status config.status: creating src/bzip2/Makefile config.status: creating src/zstd/Makefile config.status: creating src/blosc/lib/blosc-1.20.1/Makefile config.status: creating src/blosc/Makefile config.status: creating src/vbz/Makefile config.status: creating src/vbz/third_party/streamvbyte/Makefile config.status: creating src/Makevars ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ make -C zstd make[1]: Entering directory '/tmp/RtmpOU5ujI/R.INSTALL355aee4748694a/rhdf5filters/src/zstd' gcc -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic -shared H5Zzstd.c -I"/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include" \ -lzstd -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o libH5Zzstd.so make[1]: Leaving directory '/tmp/RtmpOU5ujI/R.INSTALL355aee4748694a/rhdf5filters/src/zstd' make -C blosc make[1]: Entering directory '/tmp/RtmpOU5ujI/R.INSTALL355aee4748694a/rhdf5filters/src/blosc' g++ -std=gnu++17 -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic -shared -I"/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include" H5Zblosc.cpp \ -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -lblosc -lzstd -lz -o libH5Zblosc.so make[1]: Leaving directory '/tmp/RtmpOU5ujI/R.INSTALL355aee4748694a/rhdf5filters/src/blosc' make -C bzip2 make[1]: Entering directory '/tmp/RtmpOU5ujI/R.INSTALL355aee4748694a/rhdf5filters/src/bzip2' gcc -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic -shared H5Zbzip2.c -I"/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include" \ -lbz2 -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o libH5Zbz2.so make[1]: Leaving directory '/tmp/RtmpOU5ujI/R.INSTALL355aee4748694a/rhdf5filters/src/bzip2' make -C lzf make[1]: Entering directory '/tmp/RtmpOU5ujI/R.INSTALL355aee4748694a/rhdf5filters/src/lzf' make -C lzf make[2]: Entering directory '/tmp/RtmpOU5ujI/R.INSTALL355aee4748694a/rhdf5filters/src/lzf/lzf' gcc -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic -c lzf_c.c gcc -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic -c lzf_d.c rm -f liblzf.a ar cq liblzf.a lzf_c.o lzf_d.o ranlib liblzf.a make[2]: Leaving directory '/tmp/RtmpOU5ujI/R.INSTALL355aee4748694a/rhdf5filters/src/lzf/lzf' gcc -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic -shared H5Zlzf.c -I"/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include" \ -I./lzf/ ./lzf/liblzf.a -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o libH5Zlzf.so make[1]: Leaving directory '/tmp/RtmpOU5ujI/R.INSTALL355aee4748694a/rhdf5filters/src/lzf' make -C vbz make[1]: Entering directory '/tmp/RtmpOU5ujI/R.INSTALL355aee4748694a/rhdf5filters/src/vbz' make -C third_party/streamvbyte make[2]: Entering directory '/tmp/RtmpOU5ujI/R.INSTALL355aee4748694a/rhdf5filters/src/vbz/third_party/streamvbyte' gcc -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic -Iinclude -std=c99 -mavx -c ./src/streamvbyte_decode.c gcc -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic -Iinclude -std=c99 -mavx -c ./src/streamvbyte_encode.c gcc -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic -Iinclude -std=c99 -mavx -c ./src/streamvbytedelta_decode.c gcc -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic -Iinclude -std=c99 -mavx -c ./src/streamvbytedelta_encode.c gcc -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic -Iinclude -std=c99 -mavx -c ./src/streamvbyte_0124_encode.c gcc -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic -Iinclude -std=c99 -mavx -c ./src/streamvbyte_0124_decode.c gcc -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic -Iinclude -std=c99 -mavx -c ./src/streamvbyte_zigzag.c rm -f libstreamvbyte.a ar cq libstreamvbyte.a streamvbyte_decode.o streamvbyte_encode.o streamvbytedelta_decode.o streamvbytedelta_encode.o streamvbyte_0124_encode.o streamvbyte_0124_decode.o streamvbyte_zigzag.o ranlib libstreamvbyte.a make[2]: Leaving directory '/tmp/RtmpOU5ujI/R.INSTALL355aee4748694a/rhdf5filters/src/vbz/third_party/streamvbyte' make -C vbz make[2]: Entering directory '/tmp/RtmpOU5ujI/R.INSTALL355aee4748694a/rhdf5filters/src/vbz/vbz' g++ -std=gnu++17 -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic -I"/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include" -I../third_party/streamvbyte/include/ -I../third_party/ -I../../zstd/ -c vbz.cpp -o vbz.o g++ -std=gnu++17 -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic -I"/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include" -I../third_party/streamvbyte/include/ -I../third_party/ -I../../zstd/ -c v0/vbz_streamvbyte.cpp -o v0/vbz_streamvbyte.o g++ -std=gnu++17 -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic -I"/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include" -I../third_party/streamvbyte/include/ -I../third_party/ -I../../zstd/ -c v1/vbz_streamvbyte.cpp -o v1/vbz_streamvbyte.o make[2]: Leaving directory '/tmp/RtmpOU5ujI/R.INSTALL355aee4748694a/rhdf5filters/src/vbz/vbz' rm -f libvbz.a ar cq libvbz.a vbz/vbz.o vbz/v0/vbz_streamvbyte.o vbz/v1/vbz_streamvbyte.o ranlib libvbz.a g++ -std=gnu++17 -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic -I"/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include" -shared vbz_plugin.cpp \ libvbz.a -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -lzstd third_party/streamvbyte/libstreamvbyte.a -o libH5Zvbz.so make[1]: Leaving directory '/tmp/RtmpOU5ujI/R.INSTALL355aee4748694a/rhdf5filters/src/vbz' mkdir -p "/home/omnipath/local/R/4.3-3.18/00LOCK-rhdf5filters/00new/rhdf5filters/lib/" cp bzip2/libH5Zbz2.so blosc/libH5Zblosc.so lzf/libH5Zlzf.so zstd/libH5Zzstd.so vbz/libH5Zvbz.so "/home/omnipath/local/R/4.3-3.18/00LOCK-rhdf5filters/00new/rhdf5filters/lib/" gcc -I"/usr/share/R/include" -DNDEBUG -I"/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include" -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c rhdf5filters.c -o rhdf5filters.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o rhdf5filters.so rhdf5filters.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-rhdf5filters/00new/rhdf5filters/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (rhdf5filters) * installing *source* package ‘S4Vectors’ ... ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c AEbufs.c -o AEbufs.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c DataFrame_class.c -o DataFrame_class.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c Hits_class.c -o Hits_class.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c LLint_class.c -o LLint_class.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c List_class.c -o List_class.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_init_S4Vectors.c -o R_init_S4Vectors.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c Rle_class.c -o Rle_class.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c Rle_utils.c -o Rle_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SEXP_utils.c -o SEXP_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SimpleList_class.c -o SimpleList_class.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c anyMissing.c -o anyMissing.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c character_utils.c -o character_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c eval_utils.c -o eval_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c hash_utils.c -o hash_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c integer_utils.c -o integer_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c logical_utils.c -o logical_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c map_ranges_to_runs.c -o map_ranges_to_runs.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c raw_utils.c -o raw_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c safe_arithm.c -o safe_arithm.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c sort_utils.c -o sort_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c subsetting_utils.c -o subsetting_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c vector_utils.c -o vector_utils.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o S4Vectors.so AEbufs.o DataFrame_class.o Hits_class.o LLint_class.o List_class.o R_init_S4Vectors.o Rle_class.o Rle_utils.o SEXP_utils.o SimpleList_class.o anyMissing.o character_utils.o eval_utils.o hash_utils.o integer_utils.o logical_utils.o map_ranges_to_runs.o raw_utils.o safe_arithm.o sort_utils.o subsetting_utils.o vector_utils.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-S4Vectors/00new/S4Vectors/libs ** R ** inst ** byte-compile and prepare package for lazy loading in method for ‘normalizeSingleBracketReplacementValue’ with signature ‘"List"’: no definition for class “List” Creating a new generic function for ‘unname’ in package ‘S4Vectors’ Creating a new generic function for ‘expand.grid’ in package ‘S4Vectors’ Creating a new generic function for ‘findMatches’ in package ‘S4Vectors’ Creating a generic function for ‘setequal’ from package ‘base’ in package ‘S4Vectors’ in method for ‘coerce’ with signature ‘"Hits","DFrame"’: no definition for class “DFrame” Creating a generic function for ‘as.factor’ from package ‘base’ in package ‘S4Vectors’ Creating a generic function for ‘tabulate’ from package ‘base’ in package ‘S4Vectors’ Creating a generic function for ‘cov’ from package ‘stats’ in package ‘S4Vectors’ Creating a generic function for ‘cor’ from package ‘stats’ in package ‘S4Vectors’ Creating a generic function for ‘smoothEnds’ from package ‘stats’ in package ‘S4Vectors’ Creating a generic function for ‘runmed’ from package ‘stats’ in package ‘S4Vectors’ Creating a generic function for ‘nchar’ from package ‘base’ in package ‘S4Vectors’ Creating a generic function for ‘substr’ from package ‘base’ in package ‘S4Vectors’ Creating a generic function for ‘substring’ from package ‘base’ in package ‘S4Vectors’ Creating a generic function for ‘chartr’ from package ‘base’ in package ‘S4Vectors’ Creating a generic function for ‘tolower’ from package ‘base’ in package ‘S4Vectors’ Creating a generic function for ‘toupper’ from package ‘base’ in package ‘S4Vectors’ Creating a generic function for ‘sub’ from package ‘base’ in package ‘S4Vectors’ Creating a generic function for ‘gsub’ from package ‘base’ in package ‘S4Vectors’ Creating a generic function for ‘nlevels’ from package ‘base’ in package ‘S4Vectors’ in method for ‘coerce’ with signature ‘"data.table","DFrame"’: no definition for class “data.table” Creating a generic function for ‘complete.cases’ from package ‘stats’ in package ‘S4Vectors’ ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (S4Vectors) * installing *source* package ‘sparseMatrixStats’ ... ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ using C++11 g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c RcppExports.cpp -o RcppExports.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SparseMatrixView.cpp -o SparseMatrixView.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c methods.cpp -o methods.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c row_methods.cpp -o row_methods.o g++ -std=gnu++11 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o sparseMatrixStats.so RcppExports.o SparseMatrixView.o methods.o row_methods.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-sparseMatrixStats/00new/sparseMatrixStats/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (sparseMatrixStats) * installing *source* package ‘basilisk’ ... ** using non-staged installation via StagedInstall field ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded * DONE (basilisk) * installing *source* package ‘BiocNeighbors’ ... ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ using C++11 g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c RcppExports.cpp -o RcppExports.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c annoy.cpp -o annoy.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c build_annoy.cpp -o build_annoy.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c build_hnsw.cpp -o build_hnsw.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c build_vptree.cpp -o build_vptree.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c distances.cpp -o distances.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c exhaustive.cpp -o exhaustive.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c find_annoy.cpp -o find_annoy.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c find_exhaustive.cpp -o find_exhaustive.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c find_hnsw.cpp -o find_hnsw.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c find_kmknn.cpp -o find_kmknn.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c find_mutual_nns.cpp -o find_mutual_nns.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c find_vptree.cpp -o find_vptree.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c hnsw.cpp -o hnsw.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c kmknn.cpp -o kmknn.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c query_annoy.cpp -o query_annoy.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c query_exhaustive.cpp -o query_exhaustive.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c query_hnsw.cpp -o query_hnsw.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c query_kmknn.cpp -o query_kmknn.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c query_vptree.cpp -o query_vptree.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c utils.cpp -o utils.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppHNSW/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c vptree.cpp -o vptree.o g++ -std=gnu++11 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o BiocNeighbors.so RcppExports.o annoy.o build_annoy.o build_hnsw.o build_vptree.o distances.o exhaustive.o find_annoy.o find_exhaustive.o find_hnsw.o find_kmknn.o find_mutual_nns.o find_vptree.o hnsw.o kmknn.o query_annoy.o query_exhaustive.o query_hnsw.o query_kmknn.o query_vptree.o utils.o vptree.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-BiocNeighbors/00new/BiocNeighbors/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (BiocNeighbors) * installing *source* package ‘IRanges’ ... ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c CompressedAtomicList_utils.c -o CompressedAtomicList_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c CompressedIRangesList_class.c -o CompressedIRangesList_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c CompressedList_class.c -o CompressedList_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c Grouping_class.c -o Grouping_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c IPosRanges_comparison.c -o IPosRanges_comparison.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c IRanges_class.c -o IRanges_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c IRanges_constructor.c -o IRanges_constructor.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c NCList.c -o NCList.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_init_IRanges.c -o R_init_IRanges.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c Ranges_class.c -o Ranges_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c RleViews_utils.c -o RleViews_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c S4Vectors_stubs.c -o S4Vectors_stubs.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SimpleIRangesList_class.c -o SimpleIRangesList_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c coverage_methods.c -o coverage_methods.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c extractListFragments.c -o extractListFragments.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c inter_range_methods.c -o inter_range_methods.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o IRanges.so CompressedAtomicList_utils.o CompressedIRangesList_class.o CompressedList_class.o Grouping_class.o IPosRanges_comparison.o IRanges_class.o IRanges_constructor.o NCList.o R_init_IRanges.o Ranges_class.o RleViews_utils.o S4Vectors_stubs.o SimpleIRangesList_class.o coverage_methods.o extractListFragments.o inter_range_methods.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-IRanges/00new/IRanges/libs ** R ** inst ** byte-compile and prepare package for lazy loading Creating a generic function for ‘drop’ from package ‘base’ in package ‘IRanges’ Creating a generic function for ‘runmed’ from package ‘stats’ in package ‘IRanges’ Creating a generic function for ‘chartr’ from package ‘base’ in package ‘IRanges’ Creating a generic function for ‘toupper’ from package ‘base’ in package ‘IRanges’ Creating a generic function for ‘tolower’ from package ‘base’ in package ‘IRanges’ Creating a generic function for ‘sub’ from package ‘base’ in package ‘IRanges’ Creating a generic function for ‘gsub’ from package ‘base’ in package ‘IRanges’ Creating a generic function for ‘startsWith’ from package ‘base’ in package ‘IRanges’ Creating a generic function for ‘endsWith’ from package ‘base’ in package ‘IRanges’ Creating a generic function for ‘smoothEnds’ from package ‘stats’ in package ‘IRanges’ ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (IRanges) * installing *source* package ‘piano’ ... ** using staged installation ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (piano) * installing *source* package ‘RBGL’ ... ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c bbc.cpp -o bbc.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:249:47: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_unweighted_shortest_paths]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:412:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >, boost::property > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_unweighted_shortest_paths]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:412:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >, boost::property > > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_unweighted_shortest_paths]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:412:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:13, from bbc.cpp:37: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list >, boost::property > >]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_unweighted_shortest_paths]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:412:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >, boost::property > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >, boost::property > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:118:24: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >; BFSVisitor = boost::detail::dijkstra_bfs_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >; ColorMap = boost::two_bit_color_map >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = boost::two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:13, from bbc.cpp:37: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >; Graph = boost::adjacency_list >, boost::property > >]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >; BFSVisitor = boost::detail::dijkstra_bfs_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >; ColorMap = boost::two_bit_color_map >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = boost::two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >; Graph = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper::type boost::detail::vertex_property_map_generator_helper::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::adjacency_list >, boost::property > >; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Value = long unsigned int; boost::detail::vertex_property_map_generator_helper::type = boost::iterator_property_map >, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator::type boost::detail::vertex_property_map_generator::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::adjacency_list >, boost::property > >; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Value = long unsigned int; boost::detail::vertex_property_map_generator::type = boost::iterator_property_map >, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:377:38: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = boost::two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c cliques.cpp -o cliques.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from cliques.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c clusteringCoef.cpp -o clusteringCoef.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from clusteringCoef.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c dominatorTree.cpp -o dominatorTree.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:123:5: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BidirectionalGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:15: note: in a call to non-static member function ‘boost::concepts::BidirectionalGraphConcept > >::~BidirectionalGraphConcept()’ 118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G > | ^~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: note: in expansion of macro ‘BOOST_concept’ 118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BidirectionalGraph > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:123:5: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:123:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 123 | BOOST_CONCEPT_USAGE(BidirectionalGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:126:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:126:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::bidirectional_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:15, from dominatorTree.cpp:2: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; Graph = boost::adjacency_list >]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:126:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::bidirectional_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; Graph = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c edmonds_optimum_branching.cpp -o edmonds_optimum_branching.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:524:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ edmonds_optimum_branching_impl.hpp:525:77: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:17: note: in a call to non-static member function ‘boost::InputIteratorConcept::~InputIteratorConcept()’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >::~OutputIteratorConcept()’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:524:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:524:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ edmonds_optimum_branching_impl.hpp:525:77: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ edmonds_optimum_branching_impl.hpp:525:77: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = std::back_insert_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator::~OutputIterator() [with TT = std::back_insert_iterator > >; ValueT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 529 | BOOST_CONCEPT_USAGE(OutputIterator) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ edmonds_optimum_branching_impl.hpp:524:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ edmonds_optimum_branching_impl.hpp:525:77: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c hcs.cpp -o hcs.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:19, from mincut.hpp:4, from hcs.cpp:2: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c incrConnComp.cpp -o incrConnComp.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from incrConnComp.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c interfaces.cpp -o interfaces.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from interfaces.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = dfs_time_visitor; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = dfs_time_visitor; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from interfaces.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from interfaces.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept > >, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >]’ interfaces.cpp:71:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from interfaces.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from interfaces.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = bfs_time_visitor; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = dfs_time_visitor]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:190:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::dummy_property_map; Key = boost::detail::edge_desc_impl]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:192:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >]’ interfaces.cpp:71:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept > >, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >]’ interfaces.cpp:71:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = bfs_time_visitor; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::components_recorder]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:115:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:119:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:190:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::dummy_property_map; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >]’ interfaces.cpp:71:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::topo_sort_visitor > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = bfs_time_visitor]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:115:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:185:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::biconnected_components_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:211:27: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from interfaces.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::tarjan_scc_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::tarjan_scc_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; T = boost::graph_visitor_t; R = boost::bgl_named_params; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:129:27: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from interfaces.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::tarjan_scc_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::biconnected_components_visitor, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:211:27: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from interfaces.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::tarjan_scc_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::biconnected_components_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::tarjan_scc_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::biconnected_components_visitor, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c minST.cpp -o minST.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >::~OutputIteratorConcept()’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:251:3: required from ‘struct boost::ComparableConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ComparableConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:64:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ComparableConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:64:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:251:17: note: in a call to non-static member function ‘boost::ComparableConcept::~ComparableConcept()’ 251 | BOOST_concept(Comparable,(TT)) | ^~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:251:3: note: in expansion of macro ‘BOOST_concept’ 251 | BOOST_concept(Comparable,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:65:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:65:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::IntegerConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:66:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:70:17: note: in a call to non-static member function ‘boost::IntegerConcept::~IntegerConcept()’ 70 | BOOST_concept(Integer, (T)) | ^~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:70:3: note: in expansion of macro ‘BOOST_concept’ 70 | BOOST_concept(Integer, (T)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >::~OutputIteratorConcept()’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = std::back_insert_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator::~OutputIterator() [with TT = std::back_insert_iterator > >; ValueT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 529 | BOOST_CONCEPT_USAGE(OutputIterator) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:251:3: required from ‘struct boost::ComparableConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ComparableConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:64:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = double]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:65:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = std::back_insert_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator::~OutputIterator() [with TT = std::back_insert_iterator > >; ValueT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 529 | BOOST_CONCEPT_USAGE(OutputIterator) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:15, from minST.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper::type boost::detail::vertex_property_map_generator_helper::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = R_adjacency_list; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; boost::detail::vertex_property_map_generator_helper::type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator::type boost::detail::vertex_property_map_generator::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = R_adjacency_list; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; boost::detail::vertex_property_map_generator::type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:377:38: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c mincut.cpp -o mincut.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:19, from mincut.hpp:4, from mincut.cpp:2: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edge_connectivity.hpp:19, from mincut.hpp:4, from mincut.cpp:2: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; Graph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; Graph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c ordering.cpp -o ordering.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/king_ordering.hpp:18, from ordering.cpp:9: /home/omnipath/local/R/4.3-3.18/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl, boost::iterator_property_map, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9: required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list; DegreeMap = boost::iterator_property_map, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = boost::iterator_property_map, long unsigned int>, int, int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:141:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl, boost::iterator_property_map, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9: required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list; DegreeMap = boost::iterator_property_map, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = boost::iterator_property_map, long unsigned int>, int, int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:141:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl, boost::iterator_property_map, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9: required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list; DegreeMap = boost::iterator_property_map, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = boost::iterator_property_map, long unsigned int>, int, int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:141:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:16, from ordering.cpp:2: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::dfs_visitor<>; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl, boost::iterator_property_map, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9: required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list; DegreeMap = boost::iterator_property_map, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = boost::iterator_property_map, long unsigned int>, int, int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:141:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept > >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept > >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:321:7: required from ‘struct boost::UnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::UnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:17: note: in a call to non-static member function ‘boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>::~AdaptableUnaryFunctionConcept()’ 454 | BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg)) | ^~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:3: note: in expansion of macro ‘BOOST_concept’ 454 | BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, int, const int&, boost::vertex_index_t>, void*>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:515:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; Key = void*]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::dfs_visitor<>; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::sparse_ordering_queue > >; BFSVisitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::sparse_ordering_queue > >; BFSVisitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque::vertex_descriptor, std::allocator::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/detail/sparse_ordering.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:15, from ordering.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::UnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:321:7: required from ‘struct boost::UnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::UnaryFunction::~UnaryFunction() [with Func = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Return = long unsigned int; Arg = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:321:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 321 | BOOST_CONCEPT_USAGE(UnaryFunction) { test(is_void()); } | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:515:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; Key = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, int, const int&, boost::vertex_index_t>, void*>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, int, const int&, boost::vertex_index_t>, void*> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, int, const int&, boost::vertex_index_t>, void*> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:515:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::dfs_visitor<>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::sparse_ordering_queue > >; BFSVisitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::sparse_ordering_queue > >; BFSVisitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque::vertex_descriptor, std::allocator::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::sparse_ordering_queue > >; BFSVisitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::sparse_ordering_queue > >; BFSVisitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque::vertex_descriptor, std::allocator::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:450:11: required from ‘boost::AdaptableUnaryFunction::~AdaptableUnaryFunction() [with Func = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Return = long unsigned int; Arg = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:463:11: required from ‘boost::AdaptableUnaryFunction::~AdaptableUnaryFunction() [with Func = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Return = long unsigned int; Arg = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = void*; Y = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:515:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::safe_iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = char&; typename std::iterator_traits< >::value_type = char; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:152:13: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:281:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:191:13: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:191:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:322:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:218:14: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:218:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:356:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:239:14: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:239:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:374:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&) [with RandomAccessRange = std::vector]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/functions.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/iterator_range_core.hpp:38, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/iterator_range.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/irange.hpp:16, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/detail/adjacency_list.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:255, from RBGL.hpp:38, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:178:27: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘bool boost::range::equal(const SinglePassRange1&, const SinglePassRange2&) [with SinglePassRange1 = std::vector; SinglePassRange2 = std::vector]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:178:27: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:281:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:322:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:356:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:374:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector; BinaryPredicate = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::compare_multiplicity]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/functions.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/iterator_range_core.hpp:38, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/iterator_range.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/irange.hpp:16, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/detail/adjacency_list.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:255, from RBGL.hpp:38, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::safe_iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = int&; typename std::iterator_traits< >::value_type = int; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:281:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, std::allocator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:322:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:356:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:374:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector, std::allocator > >; BinaryPredicate = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::edge_cmp]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/functions.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/iterator_range_core.hpp:38, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/iterator_range.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/irange.hpp:16, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/detail/adjacency_list.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:255, from RBGL.hpp:38, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept, std::allocator > > >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::rcm_queue >, std::deque > >; BFSVisitor = boost::bfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::rcm_queue >, std::deque > >; BFSVisitor = boost::bfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:363:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with IncidenceGraph = R_adjacency_list; P = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; T = boost::vertex_color_t; R = boost::bgl_named_params >, std::deque > > >, boost::buffer_param_t, boost::no_property>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/detail/sparse_ordering.hpp:152:24: required from ‘Vertex boost::pseudo_peripheral_pair(const Graph&, const Vertex&, int&, ColorMap, DegreeMap) [with Graph = R_adjacency_list; Vertex = long unsigned int; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/detail/sparse_ordering.hpp:170:31: required from ‘Vertex boost::find_starting_node(const Graph&, Vertex, Color, Degree) [with Graph = R_adjacency_list; Vertex = long unsigned int; Color = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:155:32: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/detail/sparse_ordering.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:15, from ordering.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor<>; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::sparse_ordering_queue > >; BFSVisitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::sparse_ordering_queue > >; BFSVisitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque::vertex_descriptor, std::allocator::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = void*; Y = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:178:27: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order, boost::adjacency_list > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:16, from ordering.cpp:2: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; Graph = boost::adjacency_list >]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, std::allocator > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector, std::allocator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::incrementable_traversal_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::incrementable_traversal_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::iterators::incrementable_traversal_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::single_pass_traversal_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::single_pass_traversal_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::iterators::single_pass_traversal_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:152:13: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘typename boost::range_difference::type boost::range::count_if(const SinglePassRange&, UnaryPredicate) [with SinglePassRange = std::pair >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >; UnaryPredicate = boost::indirect_pmap >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, char, char&> >; typename boost::range_difference::type = long int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:304:51: required from ‘bool boost::detail::isomorphism_algo::match(boost::detail::isomorphism_algo::edge_iter, int) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; boost::detail::isomorphism_algo::edge_iter = std::vector, std::allocator > >::iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::pair >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::rcm_queue >, std::deque > >; BFSVisitor = boost::bfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:363:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with IncidenceGraph = R_adjacency_list; P = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; T = boost::vertex_color_t; R = boost::bgl_named_params >, std::deque > > >, boost::buffer_param_t, boost::no_property>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/detail/sparse_ordering.hpp:152:24: required from ‘Vertex boost::pseudo_peripheral_pair(const Graph&, const Vertex&, int&, ColorMap, DegreeMap) [with Graph = R_adjacency_list; Vertex = long unsigned int; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/detail/sparse_ordering.hpp:170:31: required from ‘Vertex boost::find_starting_node(const Graph&, Vertex, Color, Degree) [with Graph = R_adjacency_list; Vertex = long unsigned int; Color = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:155:32: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor<>; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::rcm_queue >, std::deque > >; BFSVisitor = boost::bfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:363:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with IncidenceGraph = R_adjacency_list; P = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; T = boost::vertex_color_t; R = boost::bgl_named_params >, std::deque > > >, boost::buffer_param_t, boost::no_property>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/detail/sparse_ordering.hpp:152:24: required from ‘Vertex boost::pseudo_peripheral_pair(const Graph&, const Vertex&, int&, ColorMap, DegreeMap) [with Graph = R_adjacency_list; Vertex = long unsigned int; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/detail/sparse_ordering.hpp:170:31: required from ‘Vertex boost::find_starting_node(const Graph&, Vertex, Color, Degree) [with Graph = R_adjacency_list; Vertex = long unsigned int; Color = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:155:32: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = std::_List_iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; Graph = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order, boost::adjacency_list > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order, boost::adjacency_list > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order, boost::adjacency_list > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::incrementable_traversal_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::incrementable_traversal_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::single_pass_traversal_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::single_pass_traversal_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::pair >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::rcm_queue >, std::deque > >; BFSVisitor = boost::bfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:363:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with IncidenceGraph = R_adjacency_list; P = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; T = boost::vertex_color_t; R = boost::bgl_named_params >, std::deque > > >, boost::buffer_param_t, boost::no_property>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/detail/sparse_ordering.hpp:152:24: required from ‘Vertex boost::pseudo_peripheral_pair(const Graph&, const Vertex&, int&, ColorMap, DegreeMap) [with Graph = R_adjacency_list; Vertex = long unsigned int; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/detail/sparse_ordering.hpp:170:31: required from ‘Vertex boost::find_starting_node(const Graph&, Vertex, Color, Degree) [with Graph = R_adjacency_list; Vertex = long unsigned int; Color = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:155:32: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor<>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list > > >; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list > > >; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list > > >; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list > > >; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list > > >; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list > > >; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/detail/sparse_ordering.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:15, from ordering.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; Graph = boost::adjacency_list > > >]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list > > >; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list > > >; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list > > >; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; Graph = boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = std::_List_iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = std::_List_iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list > > >; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list > > >; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list > > >; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list > > >; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c planar.cpp -o planar.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list, boost::property > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:12, from planar.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list, boost::property >]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adjacency_list >, long unsigned int, long unsigned int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:321:7: required from ‘struct boost::UnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adjacency_list >, long unsigned int, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::UnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:17: note: in a call to non-static member function ‘boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>::~AdaptableUnaryFunctionConcept()’ 454 | BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg)) | ^~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:3: note: in expansion of macro ‘BOOST_concept’ 454 | BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:515:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list, boost::property > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept, boost::property > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph, boost::property > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept, boost::property > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept, boost::property > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept, boost::property > >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:190:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; Key = boost::detail::edge_desc_impl]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:192:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::UnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adjacency_list >, long unsigned int, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:321:7: required from ‘struct boost::UnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::UnaryFunction::~UnaryFunction() [with Func = boost::degree_vertex_invariant >, boost::adjacency_list >; Return = long unsigned int; Arg = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:321:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 321 | BOOST_CONCEPT_USAGE(UnaryFunction) { test(is_void()); } | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::planar_dfs_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27: required from ‘boost::boyer_myrvold_impl::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:66:17: required from ‘bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::true_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >; mpl_::true_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:211:44: required from ‘bool boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test(const ArgumentPack&) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68: required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = boost::adjacency_list, boost::property >]’ planar.cpp:121:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:12, from planar.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::planar_dfs_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>; Graph = boost::adjacency_list, boost::property >]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph, boost::property > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph, boost::property > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept, boost::property > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list, boost::property >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:192:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:185:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:239:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:450:11: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:450:11: required from ‘boost::AdaptableUnaryFunction::~AdaptableUnaryFunction() [with Func = boost::degree_vertex_invariant >, boost::adjacency_list >; Return = long unsigned int; Arg = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::safe_iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::vec_adj_list_vertex_id_map; typename std::iterator_traits< >::reference = char&; typename std::iterator_traits< >::value_type = char; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:152:13: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:281:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:191:13: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:191:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:321:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:321:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:322:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:218:14: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:218:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:355:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:355:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:356:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:239:14: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:239:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:373:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:373:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/sort.hpp:32:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:374:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/sort.hpp:32:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&) [with RandomAccessRange = std::vector]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/functions.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/iterator_range_core.hpp:38, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/iterator_range.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/irange.hpp:16, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/detail/adjacency_list.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:255, from RBGL.hpp:38, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘bool boost::range::equal(const SinglePassRange1&, const SinglePassRange2&) [with SinglePassRange1 = std::vector; SinglePassRange2 = std::vector]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:178:27: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::safe_iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::vec_adj_list_vertex_id_map; typename std::iterator_traits< >::reference = int&; typename std::iterator_traits< >::value_type = int; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:281:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:321:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:322:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:355:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:356:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:373:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/sort.hpp:32:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:374:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/sort.hpp:32:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector >; BinaryPredicate = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::edge_cmp]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/functions.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/iterator_range_core.hpp:38, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/iterator_range.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/irange.hpp:16, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/detail/adjacency_list.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:255, from RBGL.hpp:38, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept > >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = boost::detail::odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:12, from planar.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::odd_components_counter; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27: required from ‘boost::boyer_myrvold_impl::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:66:17: required from ‘bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::true_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >; mpl_::true_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:211:44: required from ‘bool boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test(const ArgumentPack&) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68: required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = boost::adjacency_list, boost::property >]’ planar.cpp:121:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::planar_dfs_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27: required from ‘boost::boyer_myrvold_impl::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:66:17: required from ‘bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::true_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >; mpl_::true_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:211:44: required from ‘bool boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test(const ArgumentPack&) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68: required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = boost::adjacency_list, boost::property >]’ planar.cpp:121:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order, boost::adjacency_list >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:12, from planar.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; Graph = boost::adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::incrementable_traversal_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::incrementable_traversal_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::iterators::incrementable_traversal_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::single_pass_traversal_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::single_pass_traversal_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::iterators::single_pass_traversal_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:152:13: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘typename boost::range_difference::type boost::range::count_if(const SinglePassRange&, UnaryPredicate) [with SinglePassRange = std::pair, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >; UnaryPredicate = boost::indirect_pmap >, boost::vec_adj_list_vertex_id_map, char, char&> >; typename boost::range_difference::type = long int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:304:51: required from ‘bool boost::detail::isomorphism_algo::match(boost::detail::isomorphism_algo::edge_iter, int) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; boost::detail::isomorphism_algo::edge_iter = std::vector >::iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::pair, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::odd_components_counter; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = boost::detail::odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = boost::detail::odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = boost::detail::odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = boost::detail::odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27: required from ‘boost::boyer_myrvold_impl::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:66:17: required from ‘bool boost::boyer_myrvold_params::core::dispatched_boyer_myrvold(const ArgumentPack&, mpl_::true_, mpl_::true_) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >; mpl_::true_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:211:44: required from ‘bool boost::boyer_myrvold_params::core::boyer_myrvold_planarity_test(const ArgumentPack&) [with ArgumentPack = boost::parameter::aux::flat_like_arg_list, boost::property, boost::no_property, boost::listS> > >, std::integral_constant > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68: required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = boost::adjacency_list, boost::property >]’ planar.cpp:121:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::planar_dfs_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order, boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order, boost::adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order, boost::adjacency_list > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order, boost::adjacency_list >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::incrementable_traversal_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::incrementable_traversal_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::single_pass_traversal_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::single_pass_traversal_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::pair, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::odd_components_counter]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::biconnected_components_visitor >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:211:27: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:12, from planar.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = boost::adjacency_list, boost::property >]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:209:38: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = boost::detail::odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = boost::detail::odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::biconnected_components_visitor >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = boost::detail::odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from ‘bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c registerSigHandlers.cpp -o registerSigHandlers.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from registerSigHandlers.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c shortestPath.cpp -o shortestPath.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, double> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:516:5: required from ‘struct boost::concepts::BasicMatrix, long unsigned int, double>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:514:1: required from ‘struct boost::concepts::BasicMatrixConcept, long unsigned int, double>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, double> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, double> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, double>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BasicMatrix, long unsigned int, double>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:514:15: note: in a call to non-static member function ‘boost::concepts::BasicMatrixConcept, long unsigned int, double>::~BasicMatrixConcept()’ 514 | BOOST_concept(BasicMatrix, (M)(I)(V)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:514:1: note: in expansion of macro ‘BOOST_concept’ 514 | BOOST_concept(BasicMatrix, (M)(I)(V)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BasicMatrix, long unsigned int, double>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, double> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:516:5: required from ‘struct boost::concepts::BasicMatrix, long unsigned int, double>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:514:1: required from ‘struct boost::concepts::BasicMatrixConcept, long unsigned int, double>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, double> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, double> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, double>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::BasicMatrix::~BasicMatrix() [with M = Basic2DMatrix; I = long unsigned int; V = double]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:516:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 516 | BOOST_CONCEPT_USAGE(BasicMatrix) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept > >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept > >, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:16, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:13, from shortestPath.cpp:5: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept > >, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::topo_sort_visitor > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:218:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from shortestPath.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from shortestPath.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:176:43: required from ‘bool boost::detail::bellman_dispatch2(VertexAndEdgeListGraph&, boost::param_not_found, Size, WeightMap, PredecessorMap, DistanceMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:190:41: required from ‘bool boost::detail::bellman_dispatch(EdgeListGraph&, Size, WeightMap, DistanceMap, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&, const WeightMap&, const BinaryPredicate&, const BinaryFunction&, const Infinity&, const Zero&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:172:55: required from ‘bool boost::detail::floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph&, DistanceMatrix&, WeightMap, const boost::bgl_named_params&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/floyd_warshall_shortest.hpp:217:51: required from ‘bool boost::floyd_warshall_all_pairs_shortest_paths(const VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper::type boost::detail::vertex_property_map_generator_helper::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = R_adjacency_list; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; boost::detail::vertex_property_map_generator_helper::type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator::type boost::detail::vertex_property_map_generator::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = R_adjacency_list; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; boost::detail::vertex_property_map_generator::type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:377:38: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c sna.cpp -o sna.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, double> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:516:5: required from ‘struct boost::concepts::BasicMatrix, long unsigned int, double>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:514:1: required from ‘struct boost::concepts::BasicMatrixConcept, long unsigned int, double>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, double> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, double> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, double>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BasicMatrix, long unsigned int, double>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:514:15: note: in a call to non-static member function ‘boost::concepts::BasicMatrixConcept, long unsigned int, double>::~BasicMatrixConcept()’ 514 | BOOST_concept(BasicMatrix, (M)(I)(V)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:514:1: note: in expansion of macro ‘BOOST_concept’ 514 | BOOST_concept(BasicMatrix, (M)(I)(V)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BasicMatrix, long unsigned int, double>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, double> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:516:5: required from ‘struct boost::concepts::BasicMatrix, long unsigned int, double>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:514:1: required from ‘struct boost::concepts::BasicMatrixConcept, long unsigned int, double>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, double> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, double> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, double>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:46:5: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::BasicMatrix::~BasicMatrix() [with M = Basic2DMatrix; I = long unsigned int; V = double]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:516:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 516 | BOOST_CONCEPT_USAGE(BasicMatrix) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:102:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:101:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:29, from sna.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; Graph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:29, from sna.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:40:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; Graph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:40:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:97:5: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate, BellmanFordVisitor) [with EdgeListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:112:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper::type boost::detail::vertex_property_map_generator_helper::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; boost::detail::vertex_property_map_generator_helper::type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator::type boost::detail::vertex_property_map_generator::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; boost::detail::vertex_property_map_generator::type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:377:38: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:136:24: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:127:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&, VertexID, Weight, const BinaryPredicate&, const BinaryFunction&, const Infinity&, DistanceZero) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:164:48: required from ‘bool boost::detail::johnson_dispatch(VertexAndEdgeListGraph&, DistanceMatrix&, const boost::bgl_named_params&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:192:36: required from ‘bool boost::johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&, DistanceMatrix&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c transitive_closure.cpp -o transitive_closure.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/get_pointer.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/get_pointer.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/get_pointer.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/get_pointer.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/get_pointer.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/get_pointer.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/get_pointer.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/get_pointer.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:21, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/get_pointer.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:157:5: required from ‘struct boost::concepts::AdjacencyGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘struct boost::concepts::AdjacencyGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::AdjacencyGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:15: note: in a call to non-static member function ‘boost::concepts::AdjacencyGraphConcept >::~AdjacencyGraphConcept()’ 152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: note: in expansion of macro ‘BOOST_concept’ 152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:295:5: required from ‘struct boost::concepts::VertexMutableGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:292:1: required from ‘struct boost::concepts::VertexMutableGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexMutableGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:75:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexMutableGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexMutableGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:75:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:292:15: note: in a call to non-static member function ‘boost::concepts::VertexMutableGraphConcept >::~VertexMutableGraphConcept()’ 292 | BOOST_concept(VertexMutableGraph, (G)) | ^~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:292:1: note: in expansion of macro ‘BOOST_concept’ 292 | BOOST_concept(VertexMutableGraph, (G)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:279:5: required from ‘struct boost::concepts::EdgeMutableGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:275:1: required from ‘struct boost::concepts::EdgeMutableGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeMutableGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:76:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeMutableGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeMutableGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:76:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:275:15: note: in a call to non-static member function ‘boost::concepts::EdgeMutableGraphConcept >::~EdgeMutableGraphConcept()’ 275 | BOOST_concept(EdgeMutableGraph, (G)) | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:275:1: note: in expansion of macro ‘BOOST_concept’ 275 | BOOST_concept(EdgeMutableGraph, (G)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:77:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::AdjacencyGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:157:5: required from ‘struct boost::concepts::AdjacencyGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘struct boost::concepts::AdjacencyGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:157:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 157 | BOOST_CONCEPT_USAGE(AdjacencyGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexMutableGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:295:5: required from ‘struct boost::concepts::VertexMutableGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:292:1: required from ‘struct boost::concepts::VertexMutableGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexMutableGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:75:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexMutableGraph::~VertexMutableGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:295:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 295 | BOOST_CONCEPT_USAGE(VertexMutableGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeMutableGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:279:5: required from ‘struct boost::concepts::EdgeMutableGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:275:1: required from ‘struct boost::concepts::EdgeMutableGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeMutableGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:76:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeMutableGraph::~EdgeMutableGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:279:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 279 | BOOST_CONCEPT_USAGE(EdgeMutableGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:77:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:77:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:160:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:160:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::adjacency_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:77:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:160:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::adjacency_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept > >, boost::adjacency_list >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = boost::adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:115:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:119:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept > >, boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::adjacency_list > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::adjacency_list >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:73:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:74:5: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:115:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:115:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:115:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::topo_sort_visitor > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, long unsigned int>, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:129:27: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:162:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, long unsigned int>, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:129:27: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, long unsigned int>, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:129:27: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:122:21: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:406:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:286:39: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:86:28: required from ‘void boost::transitive_closure(const Graph&, GraphTC&, G_to_TC_VertexMap, VertexIndexMap) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/BH/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c wavefront.cpp -o wavefront.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from wavefront.cpp:1: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o RBGL.so bbc.o cliques.o clusteringCoef.o dominatorTree.o edmonds_optimum_branching.o hcs.o incrConnComp.o interfaces.o minST.o mincut.o ordering.o planar.o registerSigHandlers.o shortestPath.o sna.o transitive_closure.o wavefront.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-RBGL/00new/RBGL/libs ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (RBGL) * installing *source* package ‘Rgraphviz’ ... ** using staged installation configure: Using bundled Graphviz. configure: Searching for the compilers specified by R. checking for gcc... gcc checking whether the C compiler works... yes checking for C compiler default output file name... a.out checking for suffix of executables... checking whether we are cross compiling... no checking for suffix of object files... o checking whether the compiler supports GNU C... yes checking whether gcc accepts -g... yes checking for gcc option to enable C11 features... none needed checking how to run the C preprocessor... gcc -E checking whether the compiler supports GNU C++... yes checking whether g++ -std=gnu++17 accepts -g... yes checking for g++ -std=gnu++17 option to enable C++11 features... none needed configure: Preparing to compile Graphviz. configure: Configuring bundled Graphviz. checking build system type... x86_64-pc-linux-gnu checking host system type... x86_64-pc-linux-gnu checking for a BSD-compatible install... /usr/bin/install -c checking whether build environment is sane... yes checking for a race-free mkdir -p... /usr/bin/mkdir -p checking for gawk... gawk checking whether make sets $(MAKE)... yes checking whether make supports nested variables... yes checking for style of include used by make... GNU checking for gcc... gcc checking whether the C compiler works... yes checking for C compiler default output file name... a.out checking for suffix of executables... checking whether we are cross compiling... no checking for suffix of object files... o checking whether the compiler supports GNU C... yes checking whether gcc accepts -g... yes checking for gcc option to enable C11 features... none needed checking dependency style of gcc... gcc3 checking for library containing strerror... none required checking for flex... no checking for lex... no checking for bison... no checking for byacc... no checking for gawk... (cached) gawk checking whether ln -s works... yes checking for sed... /bin/sed checking for grep... grep checking for sort... sort checking for groff... groff checking for ps2pdf... ps2pdf checking for pstopdf... (cached) ps2pdf checking for pkg-config... /usr/bin/pkg-config checking pkg-config is at least version 0.9.0... yes checking for tclsh8.6... /usr/bin/tclsh8.6 checking whether gcc and cc understand -c and -o together... yes checking whether the compiler supports GNU C++... yes checking whether g++ -std=gnu++17 accepts -g... yes checking for g++ -std=gnu++17 option to enable C++11 features... none needed checking dependency style of g++ -std=gnu++17... gcc3 checking for gcc... gcc checking whether the compiler supports GNU Objective C... no checking whether gcc accepts -g... no checking dependency style of gcc... gcc3 checking for inline... inline checking for windres... no checking for an ANSI C-conforming const... yes checking for stdio.h... yes checking for stdlib.h... yes checking for string.h... yes checking for inttypes.h... yes checking for stdint.h... yes checking for strings.h... yes checking for sys/stat.h... yes checking for sys/types.h... yes checking for unistd.h... yes checking for sys/time.h... yes checking for mode_t... yes checking for pid_t... yes checking for size_t... yes checking for ssize_t... yes checking how to run the C preprocessor... gcc -E checking for grep that handles long lines and -e... grep checking for egrep... grep -E checking for uid_t in sys/types.h... yes checking for stdarg.h... yes checking for stddef.h... yes checking for stddef.h... (cached) yes checking for stdlib.h... (cached) yes checking for stdint.h... (cached) yes checking for malloc.h... yes checking for fcntl.h... yes checking for search.h... yes checking for getopt.h... yes checking for pthread.h... yes checking for values.h... yes checking for float.h... yes checking for limits.h... yes checking for termios.h... yes checking for errno.h... yes checking for time.h... yes checking for unistd.h... (cached) yes checking for fenv.h... yes checking for string.h... (cached) yes checking for strings.h... (cached) yes checking for inttypes.h... (cached) yes checking for setjmp.h... yes checking for sys/time.h... (cached) yes checking for sys/times.h... yes checking for sys/types.h... (cached) yes checking for sys/select.h... yes checking for fpu_control.h... yes checking for sys/fpu.h... no checking for sys/socket.h... yes checking for sys/stat.h... (cached) yes checking for sys/mman.h... yes checking for sys/ioctl.h... yes checking for sys/inotify.h... yes checking for langinfo.h... yes checking for libintl.h... yes checking for crt_externs.h... no checking for dirent.h that defines DIR... yes checking for library containing opendir... none required checking for _Bool... yes checking for stdbool.h that conforms to C99... yes checking for socklen_t... yes checking for bool... yes checking for struct dioattr... no checking for main in -lm... yes checking for feenableexcept... yes checking for fesetenv... yes checking for libgen.h... yes checking for basename in -lgen... no checking for working alloca.h... yes checking for alloca... yes checking for lrand48... yes checking for drand48... yes checking for srand48... yes checking for setmode... no checking for setenv... yes checking for getenv... yes checking for __freadable... yes checking for _sysconf... no checking for getrusage... yes checking for strerror... yes checking for cbrt... no checking for lsqrt... no checking for vsnprintf... yes checking for strtoul... yes checking for strtoll... yes checking for strtoull... yes checking for uname... yes checking for memset... yes checking for nl_langinfo... yes checking for pow... no checking for sqrt... no checking for strchr... yes checking for strdup... yes checking for strerror... (cached) yes checking for strstr... yes checking for _NSGetEnviron... no checking for strcasecmp... yes checking for strncasecmp... yes checking for strcasestr... yes checking for a sed that does not truncate output... /bin/sed checking for fgrep... grep -F checking for ld used by gcc... /usr/bin/ld checking if the linker (/usr/bin/ld) is GNU ld... yes checking for BSD- or MS-compatible name lister (nm)... /usr/bin/nm -B checking the name lister (/usr/bin/nm -B) interface... BSD nm checking the maximum length of command line arguments... 1572864 checking whether the shell understands some XSI constructs... yes checking whether the shell understands "+="... yes checking for /usr/bin/ld option to reload object files... -r checking for objdump... objdump checking how to recognize dependent libraries... pass_all checking for ar... ar checking for strip... strip checking for ranlib... ranlib checking command to parse /usr/bin/nm -B output from gcc object... ok checking for dlfcn.h... yes checking whether the compiler supports GNU C++... (cached) yes checking whether g++ -std=gnu++17 accepts -g... (cached) yes checking for g++ -std=gnu++17 option to enable C++11 features... (cached) none needed checking dependency style of g++ -std=gnu++17... (cached) gcc3 checking how to run the C++ preprocessor... g++ -std=gnu++17 -E checking for objdir... .libs checking if gcc supports -fno-rtti -fno-exceptions... no checking for gcc option to produce PIC... -fPIC -DPIC checking if gcc PIC flag -fPIC -DPIC works... yes checking if gcc static flag -static works... yes checking if gcc supports -c -o file.o... yes checking if gcc supports -c -o file.o... (cached) yes checking whether the gcc linker (/usr/bin/ld -m elf_x86_64) supports shared libraries... yes checking dynamic linker characteristics... GNU/Linux ld.so checking how to hardcode library paths into programs... immediate checking for shl_load... no checking for shl_load in -ldld... no checking for dlopen... yes checking whether a program can dlopen itself... yes checking whether a statically linked program can dlopen itself... no checking whether stripping libraries is possible... yes checking if libtool supports shared libraries... yes checking whether to build shared libraries... no checking whether to build static libraries... yes checking for ld used by g++ -std=gnu++17... /usr/bin/ld -m elf_x86_64 checking if the linker (/usr/bin/ld -m elf_x86_64) is GNU ld... yes checking whether the g++ -std=gnu++17 linker (/usr/bin/ld -m elf_x86_64) supports shared libraries... yes checking for g++ -std=gnu++17 option to produce PIC... -fPIC -DPIC checking if g++ -std=gnu++17 PIC flag -fPIC -DPIC works... yes checking if g++ -std=gnu++17 static flag -static works... yes checking if g++ -std=gnu++17 supports -c -o file.o... yes checking if g++ -std=gnu++17 supports -c -o file.o... (cached) yes checking whether the g++ -std=gnu++17 linker (/usr/bin/ld -m elf_x86_64) supports shared libraries... yes checking dynamic linker characteristics... GNU/Linux ld.so checking how to hardcode library paths into programs... immediate checking for gcc options needed to detect all undeclared functions... none needed checking which extension is used for runtime loadable modules... .so checking which variable specifies run-time module search path... LD_LIBRARY_PATH checking for the default library search path... /lib64 /usr/lib64 /lib /usr/lib /opt/illumina/bsfs /usr/lib/x86_64-linux-gnu/libfakeroot /usr/local/lib/i386-linux-gnu /lib/i386-linux-gnu /usr/lib/i386-linux-gnu /usr/local/lib/i686-linux-gnu /lib/i686-linux-gnu /usr/lib/i686-linux-gnu /usr/local/lib /usr/local/lib/x86_64-linux-gnu /lib/x86_64-linux-gnu /usr/lib/x86_64-linux-gnu /lib32 /usr/lib32 checking for library containing dlopen... none required checking for dlerror... yes checking for shl_load... (cached) no checking for shl_load in -ldld... (cached) no checking for dld_link in -ldld... no checking for _ prefix in compiled symbols... no checking whether deplibs are loaded by dlopen... yes checking for argz.h... yes checking for error_t... yes checking for argz_add... yes checking for argz_append... yes checking for argz_count... yes checking for argz_create_sep... yes checking for argz_insert... yes checking for argz_next... yes checking for argz_stringify... yes checking if argz actually works... yes checking whether libtool supports -dlopen/-dlpreopen... yes checking for ltdl.h... yes checking whether lt_dlinterface_register is declared... yes checking for lt_dladvise_preload in -lltdl... yes checking where to find libltdl headers... checking where to find libltdl library... -lltdl checking for unistd.h... (cached) yes checking for dl.h... no checking for sys/dl.h... no checking for dld.h... no checking for mach-o/dyld.h... no checking for dirent.h... yes checking for closedir... yes checking for opendir... yes checking for readdir... yes checking for strlcat... no checking for strlcpy... no checking for X... disabled configure: WARNING: X11 not available. using tcl headers from -I/usr/include/tcl8.6 -I/usr/include/tcl8.6/generic checking for tcl.h... yes using /usr/lib/tclConfig.sh checking for wish8.6... /usr/bin/wish8.6 checking for tk.h... yes checking for tk.h... (cached) yes checking for tkInt.h... no using /usr/lib/tkConfig.sh checking for connect... yes checking for gethostbyname... yes checking for main in -lXpm... no configure: WARNING: Optional Xpm library not available checking for X11/Intrinsic.h... yes checking for X11/Xaw/Text.h... no configure: WARNING: Optional Xaw library not available - missing headers checking for zlib.h... yes checking for main in -lz... yes checking for deflateBound... no checking for GDK_PIXBUF... yes checking for GTK... no checking for GTKGL... no checking for GTKGLEXT... no checking for GLADE... no checking for qmake-qt4... no checking for qmake-qt3... no checking for qmake... no checking for sincos... yes checking if FILE struct contains _cnt... no checking if FILE struct contains _r... no checking if FILE struct contains _next... no checking if FILE struct contains _IO_read_end... yes checking if errno externs are declared... no checking if getopt externs are declared... yes checking if intptr_t is declared... yes checking if assert needs __eprintf... no checking that generated files are newer than configure... done configure: creating ./config.status config.status: creating Makefile config.status: creating lib/Makefile config.status: creating lib/cdt/Makefile config.status: creating lib/cdt/libcdt.pc config.status: creating lib/graph/Makefile config.status: creating lib/graph/libgraph.pc config.status: creating lib/rbtree/Makefile config.status: creating lib/pathplan/Makefile config.status: creating lib/pathplan/libpathplan.pc config.status: creating lib/dotgen/Makefile config.status: creating lib/neatogen/Makefile config.status: creating lib/fdpgen/Makefile config.status: creating lib/sparse/Makefile config.status: creating lib/sfdpgen/Makefile config.status: creating lib/osage/Makefile config.status: creating lib/circogen/Makefile config.status: creating lib/twopigen/Makefile config.status: creating lib/patchwork/Makefile config.status: creating lib/pack/Makefile config.status: creating lib/ortho/Makefile config.status: creating lib/common/Makefile config.status: creating lib/vpsc/Makefile config.status: creating lib/gvc/Makefile config.status: creating lib/gvc/libgvc.pc config.status: creating lib/xdot/Makefile config.status: creating lib/xdot/libxdot.pc config.status: creating plugin/Makefile config.status: creating plugin/core/Makefile config.status: creating plugin/dot_layout/Makefile config.status: creating plugin/neato_layout/Makefile config.status: creating graphviz.spec config.status: creating Doxyfile config.status: creating config.h config.status: executing depfiles commands config.status: executing libtool commands === configuring in libltdl (/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/libltdl) configure: running /bin/bash ./configure --disable-option-checking '--prefix=/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix' 'CC=gcc' 'CXX=g++ -std=gnu++17' 'CFLAGS=-g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2' 'CXXFLAGS=-g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2' 'LDFLAGS=-Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro' '--libdir=/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib' '--includedir=/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include' '--with-cgraph=no' '--enable-swig=no' '--enable-static' '--disable-shared' '--with-pic' '--with-libgd=no' '--disable-ltdl' '--without-x' '--without-expat' '--without-devil' '--without-rsvg' '--without-ghostscript' '--without-visio' '--without-pangocairo' '--without-lasi' '--without-glitz' '--without-freetype2' '--without-fontconfig' '--without-rpat' '--without-glut' '--without-gts' '--without-png' '--without-tcl' '--without-jpeg' 'R_LIBS=/home/omnipath/local/R/4.3-3.18/00LOCK-Rgraphviz/00new:/home/omnipath/local/R/4.3-3.18:/home/omnipath/local/R/4.3-3.18:/home/omnipath/local/R/4.3' --cache-file=/dev/null --srcdir=. checking for a BSD-compatible install... /usr/bin/install -c checking whether build environment is sane... yes checking for a race-free mkdir -p... /usr/bin/mkdir -p checking for gawk... gawk checking whether make sets $(MAKE)... yes checking build system type... x86_64-pc-linux-gnu checking host system type... x86_64-pc-linux-gnu checking for style of include used by make... GNU checking for gcc... gcc checking whether the C compiler works... yes checking for C compiler default output file name... a.out checking for suffix of executables... checking whether we are cross compiling... no checking for suffix of object files... o checking whether the compiler supports GNU C... yes checking whether gcc accepts -g... yes checking for gcc option to enable C11 features... none needed checking dependency style of gcc... gcc3 checking for a sed that does not truncate output... /bin/sed checking for grep that handles long lines and -e... /usr/bin/grep checking for egrep... /usr/bin/grep -E checking for fgrep... /usr/bin/grep -F checking for ld used by gcc... /usr/bin/ld checking if the linker (/usr/bin/ld) is GNU ld... yes checking for BSD- or MS-compatible name lister (nm)... /usr/bin/nm -B checking the name lister (/usr/bin/nm -B) interface... BSD nm checking whether ln -s works... yes checking the maximum length of command line arguments... 1572864 checking whether the shell understands some XSI constructs... yes checking whether the shell understands "+="... yes checking for /usr/bin/ld option to reload object files... -r checking for objdump... objdump checking how to recognize dependent libraries... pass_all checking for ar... ar checking for strip... strip checking for ranlib... ranlib checking command to parse /usr/bin/nm -B output from gcc object... ok checking for stdio.h... yes checking for stdlib.h... yes checking for string.h... yes checking for inttypes.h... yes checking for stdint.h... yes checking for strings.h... yes checking for sys/stat.h... yes checking for sys/types.h... yes checking for unistd.h... yes checking for dlfcn.h... yes checking for objdir... .libs checking if gcc supports -fno-rtti -fno-exceptions... no checking for gcc option to produce PIC... -fPIC -DPIC checking if gcc PIC flag -fPIC -DPIC works... yes checking if gcc static flag -static works... yes checking if gcc supports -c -o file.o... yes checking if gcc supports -c -o file.o... (cached) yes checking whether the gcc linker (/usr/bin/ld -m elf_x86_64) supports shared libraries... yes checking dynamic linker characteristics... GNU/Linux ld.so checking how to hardcode library paths into programs... immediate checking for shl_load... no checking for shl_load in -ldld... no checking for dlopen... yes checking whether a program can dlopen itself... yes checking whether a statically linked program can dlopen itself... no checking whether stripping libraries is possible... yes checking if libtool supports shared libraries... yes checking whether to build shared libraries... no checking whether to build static libraries... yes checking which extension is used for runtime loadable modules... .so checking which variable specifies run-time module search path... LD_LIBRARY_PATH checking for the default library search path... /lib64 /usr/lib64 /lib /usr/lib /opt/illumina/bsfs /usr/lib/x86_64-linux-gnu/libfakeroot /usr/local/lib/i386-linux-gnu /lib/i386-linux-gnu /usr/lib/i386-linux-gnu /usr/local/lib/i686-linux-gnu /lib/i686-linux-gnu /usr/lib/i686-linux-gnu /usr/local/lib /usr/local/lib/x86_64-linux-gnu /lib/x86_64-linux-gnu /usr/lib/x86_64-linux-gnu /lib32 /usr/lib32 checking for gcc options needed to detect all undeclared functions... none needed checking for library containing dlopen... none required checking for dlerror... yes checking for shl_load... (cached) no checking for shl_load in -ldld... (cached) no checking for dld_link in -ldld... no checking for _ prefix in compiled symbols... no checking whether deplibs are loaded by dlopen... yes checking for argz.h... yes checking for error_t... yes checking for argz_add... yes checking for argz_append... yes checking for argz_count... yes checking for argz_create_sep... yes checking for argz_insert... yes checking for argz_next... yes checking for argz_stringify... yes checking if argz actually works... yes checking whether libtool supports -dlopen/-dlpreopen... yes checking for unistd.h... (cached) yes checking for dl.h... no checking for sys/dl.h... no checking for dld.h... no checking for mach-o/dyld.h... no checking for dirent.h... yes checking for closedir... yes checking for opendir... yes checking for readdir... yes checking for strlcat... no checking for strlcpy... no checking that generated files are newer than configure... done configure: creating ./config.status config.status: creating Makefile config.status: creating config.h config.status: executing depfiles commands config.status: executing libtool commands ---------------------------------------------------------------- graphviz-2.28.0 will be compiled with the following: options: cgraph: No (disabled by default - experimental) digcola: Yes expat: No (disabled) fontconfig: No (disabled) freetype: No (disabled) glut: No (disabled) gts: No (disabled) ipsepcola: No (disabled by default - C++ portability issues) ltdl: No (disabled) ortho: Yes png: No (disabled) jpeg: No (disabled) sfdp: Yes shared: No (disabled) static: Yes qt: No (qmake not found) commands: dot: Yes (always enabled) neato: Yes (always enabled) fdp: Yes (always enabled) circo: Yes (always enabled) twopi: Yes (always enabled) gvpr: Yes (always enabled) gvmap: Yes (always enabled) lefty: No (missing Xaw headers) smyrna: No (disabled by default - experimental) gvedit: No (qmake not found) plugin libraries: dot_layout: Yes (always enabled) neato_layout: Yes (always enabled) core: Yes (always enabled) devil: No (disabled) gd: No (disabled) gdiplus: No (disabled by default - Windows only) gdk_pixbuf: Yes ghostscript: No (disabled) glitz: No (disabled by default - incomplete) gtk: No (gtk library not available) lasi: No (disabled) ming: No (disabled by default - incomplete) pangocairo: No (disabled) quartz: No (disabled by default - Mac only) rsvg: No (disabled) visio: No (disabled by default - experimental) xlib: No (disabled or unavailable) language extensions: gv_sharp: No (swig not available) gv_go: No (disabled by default - experimental) gv_guile: No (swig not available) gv_io: No (disabled by default - no swig support yet) gv_java: No (swig not available) gv_lua: No (swig not available) gv_ocaml: No (swig not available) gv_perl: No (swig not available) gv_php: No (swig not available) gv_python: No (swig not available) gv_python23: No (disabled by default - for multiversion installs) gv_python24: No (disabled by default - for multiversion installs) gv_python25: No (disabled by default - for multiversion installs) gv_python26: No (disabled by default - for multiversion installs) gv_python27: No (disabled by default - for multiversion installs) gv_R: No (swig not available) gv_ruby: No (swig not available) gv_tcl: No (swig not available) tcldot: Yes tclpathplan: Yes gdtclft: No (gd not available) tkspline: Yes grep 'PACKAGE\|VERSION\|GVPLUGIN' config.h > graphviz_version.h make install-recursive make[1]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz' Making install in libltdl make[2]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/libltdl' make install-am make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/libltdl' /bin/bash ./libtool --tag=CC --mode=compile gcc -DHAVE_CONFIG_H -I. -DLT_CONFIG_H='' -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -MT dlopen.lo -MD -MP -MF .deps/dlopen.Tpo -c -o dlopen.lo `test -f 'loaders/dlopen.c' || echo './'`loaders/dlopen.c libtool: compile: gcc -DHAVE_CONFIG_H -I. "-DLT_CONFIG_H=" -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -MT dlopen.lo -MD -MP -MF .deps/dlopen.Tpo -c loaders/dlopen.c -fPIC -DPIC -o dlopen.o mv -f .deps/dlopen.Tpo .deps/dlopen.Plo /bin/bash ./libtool --tag=CC --mode=link gcc -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -module -avoid-version -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o dlopen.la dlopen.lo libtool: link: ar cru .libs/dlopen.a dlopen.o ar: `u' modifier ignored since `D' is the default (see `U') libtool: link: ranlib .libs/dlopen.a libtool: link: ( cd ".libs" && rm -f "dlopen.la" && ln -s "../dlopen.la" "dlopen.la" ) /bin/bash ./libtool --tag=CC --mode=compile gcc -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc -DLT_CONFIG_H='' -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -MT libltdlc_la-preopen.lo -MD -MP -MF .deps/libltdlc_la-preopen.Tpo -c -o libltdlc_la-preopen.lo `test -f 'loaders/preopen.c' || echo './'`loaders/preopen.c libtool: compile: gcc -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc "-DLT_CONFIG_H=" -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -MT libltdlc_la-preopen.lo -MD -MP -MF .deps/libltdlc_la-preopen.Tpo -c loaders/preopen.c -fPIC -DPIC -o libltdlc_la-preopen.o mv -f .deps/libltdlc_la-preopen.Tpo .deps/libltdlc_la-preopen.Plo /bin/bash ./libtool --tag=CC --mode=compile gcc -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc -DLT_CONFIG_H='' -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -MT libltdlc_la-lt__alloc.lo -MD -MP -MF .deps/libltdlc_la-lt__alloc.Tpo -c -o libltdlc_la-lt__alloc.lo `test -f 'lt__alloc.c' || echo './'`lt__alloc.c libtool: compile: gcc -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc "-DLT_CONFIG_H=" -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -MT libltdlc_la-lt__alloc.lo -MD -MP -MF .deps/libltdlc_la-lt__alloc.Tpo -c lt__alloc.c -fPIC -DPIC -o libltdlc_la-lt__alloc.o mv -f .deps/libltdlc_la-lt__alloc.Tpo .deps/libltdlc_la-lt__alloc.Plo /bin/bash ./libtool --tag=CC --mode=compile gcc -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc -DLT_CONFIG_H='' -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -MT libltdlc_la-lt_dlloader.lo -MD -MP -MF .deps/libltdlc_la-lt_dlloader.Tpo -c -o libltdlc_la-lt_dlloader.lo `test -f 'lt_dlloader.c' || echo './'`lt_dlloader.c libtool: compile: gcc -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc "-DLT_CONFIG_H=" -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -MT libltdlc_la-lt_dlloader.lo -MD -MP -MF .deps/libltdlc_la-lt_dlloader.Tpo -c lt_dlloader.c -fPIC -DPIC -o libltdlc_la-lt_dlloader.o mv -f .deps/libltdlc_la-lt_dlloader.Tpo .deps/libltdlc_la-lt_dlloader.Plo /bin/bash ./libtool --tag=CC --mode=compile gcc -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc -DLT_CONFIG_H='' -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -MT libltdlc_la-lt_error.lo -MD -MP -MF .deps/libltdlc_la-lt_error.Tpo -c -o libltdlc_la-lt_error.lo `test -f 'lt_error.c' || echo './'`lt_error.c libtool: compile: gcc -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc "-DLT_CONFIG_H=" -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -MT libltdlc_la-lt_error.lo -MD -MP -MF .deps/libltdlc_la-lt_error.Tpo -c lt_error.c -fPIC -DPIC -o libltdlc_la-lt_error.o mv -f .deps/libltdlc_la-lt_error.Tpo .deps/libltdlc_la-lt_error.Plo /bin/bash ./libtool --tag=CC --mode=compile gcc -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc -DLT_CONFIG_H='' -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -MT libltdlc_la-ltdl.lo -MD -MP -MF .deps/libltdlc_la-ltdl.Tpo -c -o libltdlc_la-ltdl.lo `test -f 'ltdl.c' || echo './'`ltdl.c libtool: compile: gcc -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc "-DLT_CONFIG_H=" -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -MT libltdlc_la-ltdl.lo -MD -MP -MF .deps/libltdlc_la-ltdl.Tpo -c ltdl.c -fPIC -DPIC -o libltdlc_la-ltdl.o mv -f .deps/libltdlc_la-ltdl.Tpo .deps/libltdlc_la-ltdl.Plo /bin/bash ./libtool --tag=CC --mode=compile gcc -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc -DLT_CONFIG_H='' -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -MT libltdlc_la-slist.lo -MD -MP -MF .deps/libltdlc_la-slist.Tpo -c -o libltdlc_la-slist.lo `test -f 'slist.c' || echo './'`slist.c libtool: compile: gcc -DHAVE_CONFIG_H -I. -DLTDLOPEN=libltdlc "-DLT_CONFIG_H=" -DLTDL -I. -I. -Ilibltdl -I./libltdl -I./libltdl -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -MT libltdlc_la-slist.lo -MD -MP -MF .deps/libltdlc_la-slist.Tpo -c slist.c -fPIC -DPIC -o libltdlc_la-slist.o mv -f .deps/libltdlc_la-slist.Tpo .deps/libltdlc_la-slist.Plo /bin/bash ./libtool --tag=CC --mode=link gcc -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -no-undefined -dlpreopen dlopen.la -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o libltdlc.la libltdlc_la-preopen.lo libltdlc_la-lt__alloc.lo libltdlc_la-lt_dlloader.lo libltdlc_la-lt_error.lo libltdlc_la-ltdl.lo libltdlc_la-slist.lo lt__strl.lo libtool: link: rm -f .libs/libltdlc.nm .libs/libltdlc.nmS .libs/libltdlc.nmT libtool: link: (cd .libs && gcc -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c -fno-builtin -fPIC -DPIC "libltdlcS.c") libtool: link: rm -f ".libs/libltdlcS.c" ".libs/libltdlc.nm" ".libs/libltdlc.nmS" ".libs/libltdlc.nmT" libtool: link: (cd .libs/libltdlc.lax/dlopen.a && ar x "/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/libltdl/./.libs/dlopen.a") libtool: link: ar cru .libs/libltdlc.a libltdlc_la-preopen.o libltdlc_la-lt__alloc.o libltdlc_la-lt_dlloader.o libltdlc_la-lt_error.o libltdlc_la-ltdl.o libltdlc_la-slist.o lt__strl.o .libs/libltdlcS.o .libs/libltdlc.lax/dlopen.a/dlopen.o ar: `u' modifier ignored since `D' is the default (see `U') libtool: link: ranlib .libs/libltdlc.a libtool: link: rm -fr .libs/libltdlc.lax libtool: link: ( cd ".libs" && rm -f "libltdlc.la" && ln -s "../libltdlc.la" "libltdlc.la" ) make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/libltdl' make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/libltdl' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/libltdl' make[2]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/libltdl' Making install in lib make[2]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib' Making install in cdt make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/cdt' CC dtclose.lo CC dtdisc.lo dtdisc.c:13:16: warning: function declaration isn't a prototype [-Wstrict-prototypes] 13 | static Void_t* dtmemory(dt, addr, size, disc) | ^~~~~~~~ CC dtextract.lo CC dtflatten.lo CC dthash.lo dthash.c:15:13: warning: function declaration isn't a prototype [-Wstrict-prototypes] 15 | static void dthtab(dt) | ^~~~~~ dthash.c:81:16: warning: function declaration isn't a prototype [-Wstrict-prototypes] 81 | static Void_t* dthash(dt,obj,type) | ^~~~~~ dthash.c: In function 'dthash': dthash.c:306:34: warning: 'r' may be used uninitialized in this function [-Wmaybe-uninitialized] 306 | (*dt->memoryf)(dt,(Void_t*)r,0,disc); | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ CC dtlist.lo dtlist.c:11:16: warning: function declaration isn't a prototype [-Wstrict-prototypes] 11 | static Void_t* dtlist(dt, obj, type) | ^~~~~~ CC dtmethod.lo CC dtopen.lo CC dtrenew.lo CC dtrestore.lo CC dtsize.lo dtsize.c:11:12: warning: function declaration isn't a prototype [-Wstrict-prototypes] 11 | static int treecount(e) | ^~~~~~~~~ CC dtstat.lo dtstat.c:11:13: warning: function declaration isn't a prototype [-Wstrict-prototypes] 11 | static void dttstat(ds,root,depth,level) | ^~~~~~~ dtstat.c:31:13: warning: function declaration isn't a prototype [-Wstrict-prototypes] 31 | static void dthstat(data, ds, count) | ^~~~~~~ CC dtstrhash.lo CC dttree.lo dttree.c:14:16: warning: function declaration isn't a prototype [-Wstrict-prototypes] 14 | static Void_t* dttree(dt,obj,type) | ^~~~~~ dttree.c: In function 'dttree': dttree.c:218:37: warning: 'me' may be used uninitialized in this function [-Wmaybe-uninitialized] 218 | root->right = link.left; CC dttreeset.lo dttreeset.c:11:18: warning: function declaration isn't a prototype [-Wstrict-prototypes] 11 | static Dtlink_t* treebalance(list, size) | ^~~~~~~~~~~ CC dtview.lo dtview.c:12:16: warning: function declaration isn't a prototype [-Wstrict-prototypes] 12 | static Void_t* dtvsearch(dt,obj,type) | ^~~~~~~~~ dtview.c: In function 'dtvsearch': dtview.c:20:30: warning: variable 'lk' set but not used [-Wunused-but-set-variable] 20 | int cmp, lk, sz, ky; | ^~ CC dtwalk.lo dtwalk.c: In function 'dtwalk': dtwalk.c:14:1: warning: function declaration isn't a prototype [-Wstrict-prototypes] 14 | int(* userf)(); | ^~~ CCLD libcdt.la ar: `u' modifier ignored since `D' is the default (see `U') CCLD libcdt_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/cdt' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib' /bin/bash ../../libtool --mode=install /usr/bin/install -c libcdt.la '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib' libtool: install: /usr/bin/install -c .libs/libcdt.lai /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libcdt.la libtool: install: /usr/bin/install -c .libs/libcdt.a /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libcdt.a libtool: install: chmod 644 /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libcdt.a libtool: install: ranlib /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libcdt.a libtool: finish: PATH="/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin:/sbin" ldconfig -n /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib ---------------------------------------------------------------------- Libraries have been installed in: /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib If you ever happen to want to link against installed libraries in a given directory, LIBDIR, you must either use libtool, and specify the full pathname of the library, or use the `-LLIBDIR' flag during linking and do at least one of the following: - add LIBDIR to the `LD_LIBRARY_PATH' environment variable during execution - add LIBDIR to the `LD_RUN_PATH' environment variable during linking - use the `-Wl,-rpath -Wl,LIBDIR' linker flag - have your system administrator add LIBDIR to `/etc/ld.so.conf' See any operating system documentation about shared libraries for more information, such as the ld(1) and ld.so(8) manual pages. ---------------------------------------------------------------------- /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/man/man3' /usr/bin/install -c -m 644 cdt.3 '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/man/man3' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/install -c -m 644 cdt.3.pdf '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/install -c -m 644 libcdt.pc '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz' /usr/bin/install -c -m 644 cdt.h '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz' make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/cdt' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/cdt' Making install in graph make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/graph' CC attribs.lo CC agxbuf.lo CC edge.lo CC graph.lo graph.c: In function 'agclose': graph.c:374:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation] 374 | if (g->attr) | ^~ graph.c:376:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if' 376 | if (g->didset) | ^~ CC graphio.lo CC lexer.lo lexer.c: In function 'scan_token': lexer.c:141:11: warning: comparison between pointer and zero character constant [-Wpointer-compare] 141 | if (p == '\0') | ^~ lexer.c:141:9: note: did you mean to dereference the pointer? 141 | if (p == '\0') | ^ lexer.c:147:12: warning: pointer targets in returning 'unsigned char *' from a function with return type 'char *' differ in signedness [-Wpointer-sign] 147 | return p; | ^ lexer.c: In function 'html_pair': lexer.c:322:9: warning: variable 'rc' set but not used [-Wunused-but-set-variable] 322 | int rc, depth = 1; | ^~ In file included from lexer.c:20: lexer.c: In function 'aglex': agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ lexer.c:413:36: note: in expansion of macro 'agxbuse' 413 | aglval.str = agstrdup_html(agxbuse(&xb)); | ^~~~~~~ lexer.c:435:33: warning: pointer targets in passing argument 1 of 'scan_token' differ in signedness [-Wpointer-sign] 435 | LexPtr = scan_token(LexPtr, tbuf); | ^~~~~~ | | | char * lexer.c:136:40: note: expected 'unsigned char *' but argument is of type 'char *' 136 | static char *scan_token(unsigned char *p, unsigned char *token) | ~~~~~~~~~~~~~~~^ lexer.c:435:41: warning: pointer targets in passing argument 2 of 'scan_token' differ in signedness [-Wpointer-sign] 435 | LexPtr = scan_token(LexPtr, tbuf); | ^~~~ | | | char * lexer.c:136:58: note: expected 'unsigned char *' but argument is of type 'char *' 136 | static char *scan_token(unsigned char *p, unsigned char *token) | ~~~~~~~~~~~~~~~^~~~~ lexer.c: In function 'aglasterr': lexer.c:527:5: warning: ignoring return value of 'fread' declared with attribute 'warn_unused_result' [-Wunused-result] 527 | fread(buf, sizeof(char), len, agerrout); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ CC node.lo CC parser.lo CC refstr.lo CC trie.lo CCLD libgraph.la ar: `u' modifier ignored since `D' is the default (see `U') CCLD libgraph_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/graph' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib' /bin/bash ../../libtool --mode=install /usr/bin/install -c libgraph.la '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib' libtool: install: /usr/bin/install -c .libs/libgraph.lai /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libgraph.la libtool: install: /usr/bin/install -c .libs/libgraph.a /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libgraph.a libtool: install: chmod 644 /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libgraph.a libtool: install: ranlib /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libgraph.a libtool: finish: PATH="/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin:/sbin" ldconfig -n /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib ---------------------------------------------------------------------- Libraries have been installed in: /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib If you ever happen to want to link against installed libraries in a given directory, LIBDIR, you must either use libtool, and specify the full pathname of the library, or use the `-LLIBDIR' flag during linking and do at least one of the following: - add LIBDIR to the `LD_LIBRARY_PATH' environment variable during execution - add LIBDIR to the `LD_RUN_PATH' environment variable during linking - use the `-Wl,-rpath -Wl,LIBDIR' linker flag - have your system administrator add LIBDIR to `/etc/ld.so.conf' See any operating system documentation about shared libraries for more information, such as the ld(1) and ld.so(8) manual pages. ---------------------------------------------------------------------- /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/man/man3' /usr/bin/install -c -m 644 graph.3 '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/man/man3' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/install -c -m 644 graph.3.pdf '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/install -c -m 644 libgraph.pc '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz' /usr/bin/install -c -m 644 graph.h '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz' make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/graph' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/graph' Making install in pathplan make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/pathplan' CC cvt.lo cvt.c:276:13: warning: 'append_bezier' defined but not used [-Wunused-function] 276 | static void append_bezier(Ppoint_t * bezier) | ^~~~~~~~~~~~~ CC inpoly.lo CC route.lo route.c:107:29: warning: argument 4 of type 'Ppoint_t *' {aka 'struct Pxy_t *'} declared as a pointer [-Warray-parameter=] 107 | Ppoint_t * evs, Ppolyline_t * output) | ~~~~~~~~~~~^~~ In file included from pathutil.h:20, from route.c:21: pathplan.h:37:39: note: previously declared as an array 'Pvector_t[2]' {aka 'struct Pxy_t[2]'} 37 | Pvector_t endpoint_slopes[2], | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~ CC shortest.lo shortest.c:103:47: warning: argument 2 of type 'Ppoint_t *' {aka 'struct Pxy_t *'} declared as a pointer [-Warray-parameter=] 103 | int Pshortestpath(Ppoly_t * polyp, Ppoint_t * eps, Ppolyline_t * output) | ~~~~~~~~~~~^~~ In file included from pathutil.h:20, from shortest.c:22: pathplan.h:31:59: note: previously declared as an array 'Ppoint_t[2]' {aka 'struct Pxy_t[2]'} 31 | extern int Pshortestpath(Ppoly_t * boundary, Ppoint_t endpoints[2], | ~~~~~~~~~^~~~~~~~~~~~ CC shortestpth.lo CC solvers.lo CC triang.lo CC util.lo CC visibility.lo CCLD libpathplan.la ar: `u' modifier ignored since `D' is the default (see `U') CCLD libpathplan_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/pathplan' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib' /bin/bash ../../libtool --mode=install /usr/bin/install -c libpathplan.la '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib' libtool: install: /usr/bin/install -c .libs/libpathplan.lai /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libpathplan.la libtool: install: /usr/bin/install -c .libs/libpathplan.a /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libpathplan.a libtool: install: chmod 644 /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libpathplan.a libtool: install: ranlib /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libpathplan.a libtool: finish: PATH="/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin:/sbin" ldconfig -n /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib ---------------------------------------------------------------------- Libraries have been installed in: /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib If you ever happen to want to link against installed libraries in a given directory, LIBDIR, you must either use libtool, and specify the full pathname of the library, or use the `-LLIBDIR' flag during linking and do at least one of the following: - add LIBDIR to the `LD_LIBRARY_PATH' environment variable during execution - add LIBDIR to the `LD_RUN_PATH' environment variable during linking - use the `-Wl,-rpath -Wl,LIBDIR' linker flag - have your system administrator add LIBDIR to `/etc/ld.so.conf' See any operating system documentation about shared libraries for more information, such as the ld(1) and ld.so(8) manual pages. ---------------------------------------------------------------------- /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/man/man3' /usr/bin/install -c -m 644 pathplan.3 '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/man/man3' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/install -c -m 644 pathplan.3.pdf '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/install -c -m 644 libpathplan.pc '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz' /usr/bin/install -c -m 644 pathgeom.h pathplan.h '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz' make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/pathplan' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/pathplan' Making install in vpsc make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/vpsc' make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/vpsc' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/vpsc' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/vpsc' Making install in rbtree make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/rbtree' CC misc.lo CC red_black_tree.lo CC stack.lo CCLD librbtree_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/rbtree' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/rbtree' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/rbtree' Making install in ortho make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/ortho' CC fPQ.lo CC intset.lo CC maze.lo maze.c: In function 'mkMazeGraph': maze.c:325:20: warning: variable 'ncnt' set but not used [-Wunused-but-set-variable] 325 | int nsides, i, ncnt, maxdeg; | ^~~~ CC ortho.lo ortho.c: In function 'addLoop': ortho.c:461:16: warning: variable 'wt' set but not used [-Wunused-but-set-variable] 461 | double wt; | ^~ ortho.c: In function 'addNodeEdges': ortho.c:497:16: warning: variable 'wt' set but not used [-Wunused-but-set-variable] 497 | double wt; | ^~ ortho.c: In function 'orthoEdges': ortho.c:192:25: warning: 'prevbp.x' may be used uninitialized in this function [-Wmaybe-uninitialized] 192 | else if (prevbp.x > bp1.x) l1 = B_RIGHT; | ^ ortho.c:152:22: note: 'prevbp.x' was declared here 152 | pointf bp1, bp2, prevbp; /* bend points */ | ^~~~~~ ortho.c:179:25: warning: 'prevbp.y' may be used uninitialized in this function [-Wmaybe-uninitialized] 179 | else if (prevbp.y > bp1.y) l1 = B_UP; | ^ ortho.c:152:22: note: 'prevbp.y' was declared here 152 | pointf bp1, bp2, prevbp; /* bend points */ | ^~~~~~ ortho.c:1356:9: warning: 'ps' may be used uninitialized in this function [-Wmaybe-uninitialized] 1356 | freePS (ps); | ^~~~~~~~~~~ CC partition.lo partition.c: In function 'traverse_polygon': partition.c:328:7: warning: variable 'do_switch' set but not used [-Wunused-but-set-variable] 328 | int do_switch = FALSE; | ^~~~~~~~~ partition.c:327:7: warning: variable 'retval' set but not used [-Wunused-but-set-variable] 327 | int retval; | ^~~~~~ partition.c: In function 'partition': partition.c:731:9: warning: variable 'nt' set but not used [-Wunused-but-set-variable] 731 | int nt; | ^~ partition.c: In function 'make_new_monotone_poly': partition.c:274:5: warning: 'tq' may be used uninitialized in this function [-Wmaybe-uninitialized] 274 | q = vp1->vpos[iq]; | ~~^~~~~~~~~~~~~~~ partition.c:298:18: warning: 'tp' may be used uninitialized in this function [-Wmaybe-uninitialized] 298 | vp0->vnext[ip] = v1; | ~~~~~~~~~~~~~~~^~~~ partition.c: In function 'monotonate_trapezoids': partition.c:665:10: warning: 'size' may be used uninitialized in this function [-Wmaybe-uninitialized] 665 | return size; | ^~~~ CC rawgraph.lo CC sgraph.lo CC trapezoid.lo trapezoid.c:22: warning: "__USE_ISOC99" redefined 22 | #define __USE_ISOC99 | In file included from /usr/include/x86_64-linux-gnu/bits/libc-header-start.h:33, from /usr/include/string.h:26, from trapezoid.c:19: /usr/include/features.h:345: note: this is the location of the previous definition 345 | # define __USE_ISOC99 1 | trapezoid.c:66:12: warning: function declaration isn't a prototype [-Wstrict-prototypes] 66 | static int newnode() | ^~~~~~~ trapezoid.c: In function 'add_segment': trapezoid.c:437:7: warning: variable 'tritop' set but not used [-Wunused-but-set-variable] 437 | int tritop = 0, tribot = 0, is_swapped; | ^~~~~~ trapezoid.c: In function 'add_segment.isra': trapezoid.c:996:3: warning: 'tlastr' may be used uninitialized in this function [-Wmaybe-uninitialized] 996 | merge_trapezoids(segnum, tfirstr, tlastr, S_RIGHT, tr, qs); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ trapezoid.c:996:3: warning: 'tfirstr' may be used uninitialized in this function [-Wmaybe-uninitialized] CCLD libortho_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/ortho' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/ortho' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/ortho' Making install in sparse make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/sparse' CC SparseMatrix.lo SparseMatrix.c: In function 'SparseMatrix_import_binary': SparseMatrix.c:629:48: warning: variable 'iread' set but not used [-Wunused-but-set-variable] 629 | int m, n, nz, nzmax, type, format, property, iread; | ^~~~~ CC general.lo CC BinaryHeap.lo In file included from general.h:21, from BinaryHeap.h:17, from BinaryHeap.c:14: BinaryHeap.c: In function 'BinaryHeap_sanity_check': BinaryHeap.c:269:74: warning: suggest parentheses around assignment used as truth value [-Wparentheses] 269 | for (i = 0; i < h->len + IntStack_get_length(h->id_stack); i++) assert(mask[i] =- 1); | ^~~~ CC IntStack.lo CCLD libsparse_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/sparse' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/sparse' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/sparse' Making install in patchwork make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/patchwork' CC patchwork.lo CC patchworkinit.lo CC tree_map.lo CCLD libpatchwork_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/patchwork' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/patchwork' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/patchwork' Making install in common make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/common' CC arrows.lo arrows.c: In function 'arrowOrthoClip': arrows.c:392:28: warning: 'hlen' may be used uninitialized in this function [-Wmaybe-uninitialized] 392 | else r.x = p.x - hlen; | ~~~~^~~~~~ CC colxlate.lo CC fontmetrics.lo CC args.lo CC memory.lo CC globals.lo CC htmllex.lo In file included from render.h:47, from htmllex.c:15: htmllex.c: In function 'error_context': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ htmllex.c:57:35: note: in expansion of macro 'agxbuse' 57 | agerr(AGPREV, "... %s ...\n", agxbuse(state.xb)); | ^~~~~~~ CC htmlparse.lo In file included from render.h:47, from ../../lib/common/htmlparse.y:16: ../../lib/common/htmlparse.y: In function 'appendFItemList': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ ../../lib/common/htmlparse.y:193:25: note: in expansion of macro 'agxbuse' 193 | fi->ti.str = strdup(agxbuse(ag)); | ^~~~~~~ ../../lib/common/htmlparse.y: In function 'htmlparse': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ ../../lib/common/htmlparse.y:500:24: note: in expansion of macro 'agxbuse' 500 | if (nonSpace(agxbuse(HTMLstate.str))) { | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ ../../lib/common/htmlparse.y:511:24: note: in expansion of macro 'agxbuse' 511 | if (nonSpace(agxbuse(HTMLstate.str))) { | ^~~~~~~ CC htmltable.lo In file included from render.h:47, from htmltable.c:35: htmltable.c: In function 'initAnchor': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ htmltable.c:299:14: note: in expansion of macro 'agxbuse' 299 | id = agxbuse (&xb); | ^~~~~~~ htmltable.c: In function 'nameOf': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ htmltable.c:1665:12: note: in expansion of macro 'agxbuse' 1665 | return agxbuse(xb); | ^~~~~~~ htmltable.c: In function 'make_html_label': htmltable.c:1828:12: warning: 'env.g' may be used uninitialized [-Wmaybe-uninitialized] 1828 | g = env.g->root; | ~~~^~ htmltable.c:1809:15: note: 'env' declared here 1809 | htmlenv_t env; | ^~~ CC input.lo input.c: In function 'dotneato_basename': input.c:136:5: warning: this 'while' clause does not guard... [-Wmisleading-indentation] 136 | while (*s) s++; s--; | ^~~~~ input.c:136:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while' 136 | while (*s) s++; s--; | ^ In file included from render.h:47, from input.c:15: input.c: In function 'global_def': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ input.c:200:24: note: in expansion of macro 'agxbuse' 200 | sym = dclfun(NULL, agxbuse (xb), rhs); | ^~~~~~~ CC pointset.lo CC postproc.lo CC routespl.lo CC splines.lo CC psusershape.lo psusershape.c: In function 'user_init': psusershape.c:49:30: warning: variable 'rc' set but not used [-Wunused-but-set-variable] 49 | int saw_bb, must_inline, rc; | ^~ In file included from render.h:47, from psusershape.c:20: psusershape.c: In function 'ps_string': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ psusershape.c:303:5: note: in expansion of macro 'agxbputc' 303 | agxbputc (&xb, RPAREN); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ psusershape.c:305:9: note: in expansion of macro 'agxbuse' 305 | s = agxbuse(&xb); | ^~~~~~~ psusershape.c:268:9: warning: variable 'rc' set but not used [-Wunused-but-set-variable] 268 | int rc; | ^~ CC timing.lo CC labels.lo labels.c: In function 'xml_url_string': labels.c:561:21: warning: variable 'prev' set but not used [-Wunused-but-set-variable] 561 | char *p, *sub, *prev = NULL; | ^~~~ CC ns.lo CC shapes.lo CC utils.lo utils.c: In function 'chkPort': utils.c:690:5: warning: this 'else' clause does not guard... [-Wmisleading-indentation] 690 | else | ^~~~ utils.c:692:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'else' 692 | pt.name = s; | ^~ In file included from render.h:47, from utils.c:14: utils.c: In function 'clustNode': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ utils.c:950:5: note: in expansion of macro 'agxbputc' 950 | agxbputc(xb, ':'); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ utils.c:954:29: note: in expansion of macro 'agxbuse' 954 | cn = agnode(agroot(cg), agxbuse(xb)); | ^~~~~~~ utils.c: In function 'scanEntity': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ utils.c:1359:5: note: in expansion of macro 'agxbputc' 1359 | agxbputc(xb, '&'); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ utils.c:1369:5: note: in expansion of macro 'agxbputc' 1369 | agxbputc(xb, '#'); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ utils.c:1371:5: note: in expansion of macro 'agxbputc' 1371 | agxbputc(xb, ';'); | ^~~~~~~~ utils.c: In function 'htmlEntityUTF8': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ utils.c:1515:18: note: in expansion of macro 'agxbuse' 1515 | ns = strdup (agxbuse(&xb)); | ^~~~~~~ utils.c:1456:9: warning: variable 'rc' set but not used [-Wunused-but-set-variable] 1456 | int rc; | ^~ In file included from render.h:47, from utils.c:14: utils.c: In function 'latin1ToUTF8': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ utils.c:1555:18: note: in expansion of macro 'agxbuse' 1555 | ns = strdup (agxbuse(&xb)); | ^~~~~~~ utils.c:1531:9: warning: variable 'rc' set but not used [-Wunused-but-set-variable] 1531 | int rc; | ^~ In file included from render.h:47, from utils.c:14: utils.c: In function 'utf8ToLatin1': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ utils.c:1587:18: note: in expansion of macro 'agxbuse' 1587 | ns = strdup (agxbuse(&xb)); | ^~~~~~~ utils.c:1573:9: warning: variable 'rc' set but not used [-Wunused-but-set-variable] 1573 | int rc; | ^~ CC geom.lo CC output.lo In file included from render.h:47, from output.c:14: output.c: In function 'attach_attrs_and_arrows': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ output.c:350:29: note: in expansion of macro 'agxbuse' 350 | agset(n, "pos", agxbuse(&xb)); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ output.c:373:31: note: in expansion of macro 'agxbuse' 373 | agset(n, "rects", agxbuse(&xb)); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ output.c:391:25: note: in expansion of macro 'agxbputc' 391 | agxbputc(&xb, ' '); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ output.c:403:46: note: in expansion of macro 'agxbuse' 403 | agxset(n, N_vertices->index, agxbuse(&xb)); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ output.c:417:25: note: in expansion of macro 'agxbputc' 417 | agxbputc(&xb, ';'); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ output.c:434:29: note: in expansion of macro 'agxbputc' 434 | agxbputc(&xb, ' '); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ output.c:440:33: note: in expansion of macro 'agxbuse' 440 | agset(e, "pos", agxbuse(&xb)); | ^~~~~~~ CC emit.lo In file included from render.h:47, from emit.c:25: emit.c: In function 'getObjId': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ emit.c:212:9: note: in expansion of macro 'agxbputc' 212 | agxbputc (xb, '_'); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ emit.c:218:12: note: in expansion of macro 'agxbuse' 218 | return agxbuse(xb); | ^~~~~~~ emit.c: In function 'emit_xdot': emit.c:941:11: warning: variable 'fontname' set but not used [-Wunused-but-set-variable] 941 | char* fontname; | ^~~~~~~~ emit.c:940:12: warning: variable 'fontsize' set but not used [-Wunused-but-set-variable] 940 | double fontsize; | ^~~~~~~~ In file included from render.h:47, from emit.c:25: emit.c: In function 'selectedlayer': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ emit.c:1152:22: note: in expansion of macro 'agxbuse' 1152 | w1 = w0 = strtok(agxbuse(&xb), gvc->layerDelims); | ^~~~~~~ emit.c: In function 'nodeIntersect': emit.c:2247:11: warning: variable 'target' set but not used [-Wunused-but-set-variable] 2247 | char* target; | ^~~~~~ emit.c:2246:11: warning: variable 'tooltip' set but not used [-Wunused-but-set-variable] 2246 | char* tooltip; | ^~~~~~~ emit.c: In function 'xdotBB': emit.c:2474:12: warning: variable 'sz' set but not used [-Wunused-but-set-variable] 2474 | pointf sz; | ^~ emit.c: In function 'style_token': emit.c:3262:16: warning: variable 'rc' set but not used [-Wunused-but-set-variable] 3262 | int token, rc; | ^~ In file included from render.h:47, from emit.c:25: emit.c: In function 'parse_style': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ emit.c:3356:17: note: in expansion of macro 'agxbputc' 3356 | agxbputc(&ps_xb, '\0'); /* terminate previous */ | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ emit.c:3359:29: note: in expansion of macro 'agxbuse' 3359 | agxbput(&ps_xb, agxbuse(&xb)); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ emit.c:3360:13: note: in expansion of macro 'agxbputc' 3360 | agxbputc(&ps_xb, '\0'); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ emit.c:3372:11: note: in expansion of macro 'agxbuse' 3372 | (void)agxbuse(&ps_xb); /* adds final '\0' to buffer */ | ^~~~~~~ emit.c: In function 'getObjId': emit.c:214:5: warning: 'pfx' may be used uninitialized in this function [-Wmaybe-uninitialized] 214 | agxbput (xb, pfx); | ^~~~~~~~~~~~~~~~~ emit.c: In function 'xdotBB': emit.c:2515:18: warning: 'fontname' may be used uninitialized in this function [-Wmaybe-uninitialized] 2515 | sz = textsize (g, op->para, fontname, fontsize); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ emit.c:2515:18: warning: 'fontsize' may be used uninitialized in this function [-Wmaybe-uninitialized] emit.c: In function 'emit_edge': emit.c:1932:17: warning: 'bz.eflag' may be used uninitialized in this function [-Wmaybe-uninitialized] 1932 | arrow_gen(job, EMIT_HDRAW, bz.ep, bz.list[bz.size - 1], | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1933 | arrowsize, penwidth, bz.eflag); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ emit.c:1792:12: note: 'bz.eflag' was declared here 1792 | bezier bz; | ^~ emit.c:1921:17: warning: 'bz.sflag' may be used uninitialized in this function [-Wmaybe-uninitialized] 1921 | arrow_gen(job, EMIT_TDRAW, bz.sp, bz.list[0], | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1922 | arrowsize, penwidth, bz.sflag); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ emit.c:1792:12: note: 'bz.sflag' was declared here 1792 | bezier bz; | ^~ emit.c:1932:61: warning: 'bz.size' may be used uninitialized in this function [-Wmaybe-uninitialized] 1932 | arrow_gen(job, EMIT_HDRAW, bz.ep, bz.list[bz.size - 1], | ~~^~~~~ emit.c:1792:12: note: 'bz.size' was declared here 1792 | bezier bz; | ^~ emit.c:1932:58: warning: 'bz.list' may be used uninitialized in this function [-Wmaybe-uninitialized] 1932 | arrow_gen(job, EMIT_HDRAW, bz.ep, bz.list[bz.size - 1], | ^ emit.c:1792:12: note: 'bz.list' was declared here 1792 | bezier bz; | ^~ emit.c:1776:13: warning: 'endcolor' may be used uninitialized in this function [-Wmaybe-uninitialized] 1776 | gvrender_set_fillcolor(job, endcolor); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ emit.c:1723:11: note: 'endcolor' was declared here 1723 | char* endcolor; | ^~~~~~~~ emit.c:1746:26: warning: 'segs' may be used uninitialized in this function [-Wmaybe-uninitialized] 1746 | if (s == segs->segs) { | ~~~~^~~~~~ emit.c:1721:18: note: 'segs' was declared here 1721 | colorsegs_t* segs; | ^~~~ CCLD libcommon_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/common' make[4]: Nothing to be done for 'install-exec-am'. /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz' /usr/bin/install -c -m 644 arith.h geom.h color.h types.h textpara.h usershape.h '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz' make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/common' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/common' Making install in pack make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/pack' CC ccomps.lo CC pack.lo pack.c: In function 'putGraphs': pack.c:953:12: warning: 'pts' may be used uninitialized in this function [-Wmaybe-uninitialized] 953 | return pts; | ^~~ CCLD libpack_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/pack' make[4]: Nothing to be done for 'install-exec-am'. /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/man/man3' /usr/bin/install -c -m 644 pack.3 '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/man/man3' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/install -c -m 644 pack.3.pdf '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz' /usr/bin/install -c -m 644 pack.h '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz' make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/pack' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/pack' Making install in xdot make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/xdot' CC xdot.lo xdot.c: In function 'sprintXDot': xdot.c:537:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 537 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ xdot.c:538:21: note: in expansion of macro 'agxbputc' 538 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ xdot.c:606:16: note: in expansion of macro 'agxbuse' 606 | s = strdup(agxbuse(&xb)); | ^~~~~~~ CCLD libxdot.la ar: `u' modifier ignored since `D' is the default (see `U') CCLD libxdot_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/xdot' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib' /bin/bash ../../libtool --mode=install /usr/bin/install -c libxdot.la '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib' libtool: install: /usr/bin/install -c .libs/libxdot.lai /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libxdot.la libtool: install: /usr/bin/install -c .libs/libxdot.a /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libxdot.a libtool: install: chmod 644 /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libxdot.a libtool: install: ranlib /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libxdot.a libtool: finish: PATH="/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin:/sbin" ldconfig -n /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib ---------------------------------------------------------------------- Libraries have been installed in: /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib If you ever happen to want to link against installed libraries in a given directory, LIBDIR, you must either use libtool, and specify the full pathname of the library, or use the `-LLIBDIR' flag during linking and do at least one of the following: - add LIBDIR to the `LD_LIBRARY_PATH' environment variable during execution - add LIBDIR to the `LD_RUN_PATH' environment variable during linking - use the `-Wl,-rpath -Wl,LIBDIR' linker flag - have your system administrator add LIBDIR to `/etc/ld.so.conf' See any operating system documentation about shared libraries for more information, such as the ld(1) and ld.so(8) manual pages. ---------------------------------------------------------------------- /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/man/man3' /usr/bin/install -c -m 644 xdot.3 '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/man/man3' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/install -c -m 644 xdot.3.pdf '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/install -c -m 644 libxdot.pc '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz' /usr/bin/install -c -m 644 xdot.h '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz' make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/xdot' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/xdot' Making install in gvc make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/gvc' CC gvrender.lo CC gvlayout.lo CC gvdevice.lo In file included from ../../lib/common/types.h:18, from gvplugin_device.h:17, from gvdevice.c:55: gvdevice.c: In function 'gvfwrite': gvdevice.c:269:12: warning: suggest parentheses around assignment used as truth value [-Wparentheses] 269 | assert(size = sizeof(char)); | ^~~~ CC gvloadimage.lo CC gvcontext.lo CC gvjobs.lo CC gvevent.lo CC gvplugin.lo In file included from gvplugin.c:23: gvplugin.c: In function 'gvplugin_list': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ gvplugin.c:392:17: note: in expansion of macro 'agxbputc' 392 | agxbputc(&xb,' '); agxbput(&xb, (*pnext)->typestr); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ gvplugin.c:393:17: note: in expansion of macro 'agxbputc' 393 | agxbputc(&xb,':'); agxbput(&xb, (*pnext)->package->name); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ gvplugin.c:410:17: note: in expansion of macro 'agxbputc' 410 | agxbputc(&xb,' '); agxbput(&xb, q); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvplugin.c:423:14: note: in expansion of macro 'agxbuse' 423 | bp = agxbuse(&xb); | ^~~~~~~ CC gvconfig.lo CC gvtextlayout.lo CC gvusershape.lo gvusershape.c: In function 'gvusershape_open': gvusershape.c:415:17: warning: this 'if' clause does not guard... [-Wmisleading-indentation] 415 | if (!(us->data = (void*)find_user_shape(us->name))) | ^~ gvusershape.c:417:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if' 417 | free(us); | ^~~~ CC gvc.lo CCLD libgvc.la ar: `u' modifier ignored since `D' is the default (see `U') CCLD libgvc_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/gvc' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib' /bin/bash ../../libtool --mode=install /usr/bin/install -c libgvc.la '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib' libtool: install: /usr/bin/install -c .libs/libgvc.lai /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libgvc.la libtool: install: /usr/bin/install -c .libs/libgvc.a /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libgvc.a libtool: install: chmod 644 /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libgvc.a libtool: install: ranlib /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/libgvc.a libtool: finish: PATH="/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin:/sbin" ldconfig -n /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib ---------------------------------------------------------------------- Libraries have been installed in: /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib If you ever happen to want to link against installed libraries in a given directory, LIBDIR, you must either use libtool, and specify the full pathname of the library, or use the `-LLIBDIR' flag during linking and do at least one of the following: - add LIBDIR to the `LD_LIBRARY_PATH' environment variable during execution - add LIBDIR to the `LD_RUN_PATH' environment variable during linking - use the `-Wl,-rpath -Wl,LIBDIR' linker flag - have your system administrator add LIBDIR to `/etc/ld.so.conf' See any operating system documentation about shared libraries for more information, such as the ld(1) and ld.so(8) manual pages. ---------------------------------------------------------------------- /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/man/man3' /usr/bin/install -c -m 644 gvc.3 '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/man/man3' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/install -c -m 644 gvc.3.pdf '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/graphviz/doc/pdf' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/install -c -m 644 libgvc.pc '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/pkgconfig' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz' /usr/bin/install -c -m 644 gvc.h gvcext.h gvplugin.h gvcjob.h gvcommon.h gvplugin_render.h gvplugin_layout.h gvconfig.h gvplugin_textlayout.h gvplugin_device.h gvplugin_loadimage.h '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz' make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/gvc' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/gvc' Making install in circogen make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/circogen' CC circularinit.lo CC nodelist.lo CC block.lo CC edgelist.lo CC circular.lo CC deglist.lo CC blocktree.lo CC blockpath.lo CC circpos.lo circpos.c: In function 'doBlock': circpos.c:338:20: warning: 'midAngle' may be used uninitialized in this function [-Wmaybe-uninitialized] 338 | PSI(pi->n) = midAngle; circpos.c:264:39: note: 'midAngle' was declared here 264 | double mindistAngle, rotateAngle, midAngle; | ^~~~~~~~ CC nodeset.lo CCLD libcircogen_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/circogen' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/circogen' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/circogen' Making install in dotgen make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/dotgen' CC acyclic.lo CC class1.lo CC class2.lo CC cluster.lo CC compound.lo CC conc.lo CC decomp.lo CC fastgr.lo CC flat.lo CC dotinit.lo CC mincross.lo mincross.c: In function 'mincross.constprop': mincross.c:374:9: warning: 'sepIndex' may be used uninitialized in this function [-Wmaybe-uninitialized] 374 | int sepIndex; | ^~~~~~~~ CC position.lo CC rank.lo CC sameport.lo CC dotsplines.lo dotsplines.c: In function 'makeLineEdge': dotsplines.c:1604:30: warning: right-hand operand of comma expression has no effect [-Wunused-value] 1604 | lp = ED_label(e)->pos, lp; | ^ dotsplines.c: In function 'completeregularpath': dotsplines.c:1866:9: warning: variable 'pn' set but not used [-Wunused-but-set-variable] 1866 | int pn; | ^~ dotsplines.c:1865:13: warning: variable 'pp' set but not used [-Wunused-but-set-variable] 1865 | pointf *pp; | ^~ dotsplines.c: In function '_dot_splines': dotsplines.c:993:25: warning: 'lmaxx' may be used uninitialized in this function [-Wmaybe-uninitialized] 993 | points[5].x = lmaxx; | ~~~~~~~~~~~~^~~~~~~ dotsplines.c:882:19: note: 'lmaxx' was declared here 882 | double lminx, lmaxx; | ^~~~~ dotsplines.c:997:25: warning: 'lminx' may be used uninitialized in this function [-Wmaybe-uninitialized] 997 | points[7].x = lminx; | ~~~~~~~~~~~~^~~~~~~ dotsplines.c:882:12: note: 'lminx' was declared here 882 | double lminx, lmaxx; | ^~~~~ CC aspect.lo aspect.c: In function 'computeCombiAR': aspect.c:1614:12: warning: variable 'maxLayerIndex' set but not used [-Wunused-but-set-variable] 1614 | int i, maxLayerIndex; | ^~~~~~~~~~~~~ aspect.c: In function 'rank3': aspect.c:737:25: warning: 'maxLayerIndex' may be used uninitialized [-Wmaybe-uninitialized] 737 | layerWidthInfo[maxLayerIndex].nNodeGroupsInLayer, | ^ aspect.c:702:9: note: 'maxLayerIndex' was declared here 702 | int maxLayerIndex; | ^~~~~~~~~~~~~ aspect.c:750:9: warning: 'nextMaxWidth' may be used uninitialized in this function [-Wmaybe-uninitialized] 749 | if (nextMaxWidth <= layerWidthInfo[maxLayerIndex].width / 4 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 750 | || nextMaxWidth >= layerWidthInfo[maxLayerIndex].width * 3 / 4) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ aspect.c:703:12: note: 'nextMaxWidth' was declared here 703 | double nextMaxWidth; | ^~~~~~~~~~~~ CCLD libdotgen_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/dotgen' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/dotgen' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/dotgen' Making install in fdpgen make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/fdpgen' CC comp.lo CC dbg.lo CC grid.lo CC fdpinit.lo CC layout.lo CC tlayout.lo CC xlayout.lo CC clusteredges.lo CCLD libfdpgen_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/fdpgen' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/fdpgen' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/fdpgen' Making install in neatogen make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/neatogen' CC adjust.lo In file included from ../../lib/common/render.h:44, from neato.h:37, from adjust.c:19: adjust.c: In function 'getSizes': ../../lib/common/memory.h:39:30: warning: 'nedge_nodes' may be used uninitialized in this function [-Wmaybe-uninitialized] 39 | #define N_GNEW(n,t) (t*)gmalloc((n)*sizeof(t)) | ^~~~~~~ adjust.c:670:12: note: 'nedge_nodes' was declared here 670 | int i, nedge_nodes; | ^~~~~~~~~~~ adjust.c: In function 'removeOverlapWith': adjust.c:1045:9: warning: 'ret' may be used uninitialized in this function [-Wmaybe-uninitialized] 1045 | int ret; | ^~~ CC circuit.lo CC edges.lo CC geometry.lo CC heap.lo CC hedges.lo CC info.lo CC neatoinit.lo CC legal.lo CC lu.lo CC matinv.lo CC memory.lo CC poly.lo CC printvis.lo CC site.lo CC solve.lo CC neatosplines.lo neatosplines.c: In function 'makeObstacle': neatosplines.c:363:13: warning: variable 'desc' set but not used [-Wunused-but-set-variable] 363 | epsf_t *desc; | ^~~~ neatosplines.c: In function '_spline_edges': neatosplines.c:603:15: warning: unused variable 'rtr' [-Wunused-variable] 603 | router_t* rtr = 0; | ^~~ CC stuff.lo CC voronoi.lo voronoi.c: In function 'voronoi': voronoi.c:48:49: warning: 'newintstar.y' may be used uninitialized in this function [-Wmaybe-uninitialized] 45 | if (newsite != (struct Site *) NULL && (PQempty() | ~~~~~~~~~~ 46 | || newsite->coord.y < | ~~~~~~~~~~~~~~~~~~~~~ 47 | newintstar.y | ~~~~~~~~~~~~ 48 | || (newsite->coord.y == | ^~~~~~~~~~~~~~~~~~~~~~~ 49 | newintstar.y | ~~~~~~~~~~~~ 50 | && newsite->coord.x < | ~~~~~~~~~~~~~~~~~~~~~ 51 | newintstar.x))) { | ~~~~~~~~~~~~~~ CC stress.lo stress.c: In function 'mdsModel': stress.c:1383:19: warning: 'delta' may be used uninitialized in this function [-Wmaybe-uninitialized] 1383 | delta += abs(Dij[i*nG + j - shift] - graph[i].ewgts[e]); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ CC kkutils.lo CC matrix_ops.lo CC embed_graph.lo CC dijkstra.lo CC conjgrad.lo CC pca.lo CC closest.lo CC bfs.lo CC constraint.lo CC quad_prog_solve.lo CC smart_ini_x.lo CC constrained_majorization.lo CC opt_arrangement.lo CC overlap.lo CC call_tri.lo CC compute_hierarchy.lo CC delaunay.lo CC multispline.lo CCLD libneatogen_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/neatogen' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/neatogen' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/neatogen' Making install in twopigen make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/twopigen' CC twopiinit.lo CC circle.lo circle.c: In function 'circleLayout': circle.c:285:12: warning: 'delx' may be used uninitialized in this function [-Wmaybe-uninitialized] 285 | xf += delx; | ~~~^~~~~~~ circle.c:268:20: note: 'delx' was declared here 268 | double xf = 0, delx, d; | ^~~~ CCLD libtwopigen_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/twopigen' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/twopigen' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/twopigen' Making install in sfdpgen make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/sfdpgen' CC sfdpinit.lo CC spring_electrical.lo spring_electrical.c: In function 'rotate': spring_electrical.c:1850:8: warning: variable 'y' set but not used [-Wunused-but-set-variable] 1850 | real y[4], axis[2], center[2], x0, x1; | ^ CC LinkedList.lo CC sparse_solve.lo CC post_process.lo post_process.c: In function 'StressMajorizationSmoother2_new': post_process.c:110:36: warning: variable 'dd' set but not used [-Wunused-but-set-variable] 110 | real *avg_dist, diag_d, diag_w, *dd, dist, s = 0, stop = 0, sbot = 0; | ^~ post_process.c: In function 'StressMajorizationSmoother_smooth': post_process.c:578:102: warning: variable 'res' set but not used [-Wunused-but-set-variable] 578 | real *w, *dd, *d, *y = NULL, *x0 = NULL, *x00 = NULL, diag, diff = 1, *lambda = sm->lambda, maxit, res, alpha = 0., M = 0.; | ^~~ post_process.c:578:9: warning: variable 'w' set but not used [-Wunused-but-set-variable] 578 | real *w, *dd, *d, *y = NULL, *x0 = NULL, *x00 = NULL, diag, diff = 1, *lambda = sm->lambda, maxit, res, alpha = 0., M = 0.; | ^ post_process.c:577:32: warning: variable 'jw' set but not used [-Wunused-but-set-variable] 577 | int i, j, m, *id, *jd, *iw, *jw, idiag, flag = 0, iter = 0; | ^~ post_process.c:577:27: warning: variable 'iw' set but not used [-Wunused-but-set-variable] 577 | int i, j, m, *id, *jd, *iw, *jw, idiag, flag = 0, iter = 0; | ^~ post_process.c: In function 'TriangleSmoother_new': post_process.c:698:68: warning: variable 'jd' set but not used [-Wunused-but-set-variable] 698 | int i, j, k, m = A->m, *ia = A->ia, *ja = A->ja, *iw, *jw, *id, *jd, jdiag, nz; | ^~ post_process.c:698:63: warning: variable 'id' set but not used [-Wunused-but-set-variable] 698 | int i, j, k, m = A->m, *ia = A->ia, *ja = A->ja, *iw, *jw, *id, *jd, jdiag, nz; | ^~ CC stress_model.lo CC uniform_stress.lo uniform_stress.c: In function 'uniform_stress': uniform_stress.c:112:8: warning: variable 'res' set but not used [-Wunused-but-set-variable] 112 | real res; | ^~~ CC QuadTree.lo CC Multilevel.lo Multilevel.c: In function 'maximal_independent_vertex_set': Multilevel.c:87:30: warning: variable 'n' set but not used [-Wunused-but-set-variable] 87 | int i, ii, j, *ia, *ja, m, n, *p = NULL; | ^ Multilevel.c: In function 'maximal_independent_vertex_set_RS': Multilevel.c:138:57: warning: variable 'removed' set but not used [-Wunused-but-set-variable] 138 | int i, jj, ii, *p = NULL, j, k, *ia, *ja, m, n, gain, removed, nf = 0; | ^~~~~~~ Multilevel.c:138:48: warning: variable 'n' set but not used [-Wunused-but-set-variable] 138 | int i, jj, ii, *p = NULL, j, k, *ia, *ja, m, n, gain, removed, nf = 0; | ^ Multilevel.c: In function 'maximal_independent_edge_set_heavest_edge_pernode_leaves_first': Multilevel.c:327:30: warning: variable 'n' set but not used [-Wunused-but-set-variable] 327 | int i, ii, j, *ia, *ja, m, n, *p = NULL, q; | ^ Multilevel.c: In function 'maximal_independent_edge_set_heavest_edge_pernode_supernodes_first': Multilevel.c:502:30: warning: variable 'n' set but not used [-Wunused-but-set-variable] 502 | int i, ii, j, *ia, *ja, m, n, *p = NULL; | ^ Multilevel.c: In function 'maximal_independent_edge_set_heavest_cluster_pernode_leaves_first': Multilevel.c:646:30: warning: variable 'n' set but not used [-Wunused-but-set-variable] 646 | int i, ii, j, *ia, *ja, m, n, *p = NULL, q, iv; | ^ CC PriorityQueue.lo CCLD libsfdpgen_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/sfdpgen' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/sfdpgen' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/sfdpgen' Making install in osage make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/osage' CC osageinit.lo CCLD libosage_C.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/osage' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/osage' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib/osage' make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib' make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib' make[2]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/lib' Making install in plugin make[2]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/plugin' Making install in core make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/plugin/core' CC gvplugin_core.lo CC gvrender_core_dot.lo In file included from gvrender_core_dot.c:32: gvrender_core_dot.c: In function 'xdot_str': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ gvrender_core_dot.c:100:5: note: in expansion of macro 'agxbputc' 100 | agxbputc(xbufs[emit_state], ' '); | ^~~~~~~~ gvrender_core_dot.c: In function 'xdot_points': gvrender_core_dot.c:107:12: warning: variable 'rc' set but not used [-Wunused-but-set-variable] 107 | int i, rc; | ^~ In file included from gvrender_core_dot.c:32: gvrender_core_dot.c: In function 'xdot_style': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ gvrender_core_dot.c:162:13: note: in expansion of macro 'agxbputc' 162 | agxbputc(&xbuf, '('); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ gvrender_core_dot.c:166:21: note: in expansion of macro 'agxbputc' 166 | agxbputc(&xbuf, ','); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ gvrender_core_dot.c:172:13: note: in expansion of macro 'agxbputc' 172 | agxbputc(&xbuf, ')'); | ^~~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:174:30: note: in expansion of macro 'agxbuse' 174 | xdot_str (job, "S ", agxbuse(&xbuf)); | ^~~~~~~ gvrender_core_dot.c: In function 'xdot_end_node': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:186:38: note: in expansion of macro 'agxbuse' 186 | agxset(n, xd->n_draw->index, agxbuse(xbufs[EMIT_NDRAW])); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:192:40: note: in expansion of macro 'agxbuse' 192 | agxset(n, xd->n_l_draw->index, agxbuse(xbufs[EMIT_NLABEL])); | ^~~~~~~ gvrender_core_dot.c: In function 'xdot_end_edge': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:206:38: note: in expansion of macro 'agxbuse' 206 | agxset(e, xd->e_draw->index, agxbuse(xbufs[EMIT_EDRAW])); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:212:38: note: in expansion of macro 'agxbuse' 212 | agxset(e, xd->t_draw->index, agxbuse(xbufs[EMIT_TDRAW])); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:218:38: note: in expansion of macro 'agxbuse' 218 | agxset(e, xd->h_draw->index, agxbuse(xbufs[EMIT_HDRAW])); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:224:39: note: in expansion of macro 'agxbuse' 224 | agxset(e, xd->e_l_draw->index,agxbuse(xbufs[EMIT_ELABEL])); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:230:39: note: in expansion of macro 'agxbuse' 230 | agxset(e, xd->tl_draw->index, agxbuse(xbufs[EMIT_TLABEL])); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:236:39: note: in expansion of macro 'agxbuse' 236 | agxset(e, xd->hl_draw->index, agxbuse(xbufs[EMIT_HLABEL])); | ^~~~~~~ gvrender_core_dot.c: In function 'xdot_end_cluster': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:289:42: note: in expansion of macro 'agxbuse' 289 | agxset(cluster_g, xd->g_draw->index, agxbuse(xbufs[EMIT_CDRAW])); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:295:48: note: in expansion of macro 'agxbuse' 295 | agxset(cluster_g, xd->g_l_draw->index, agxbuse(xbufs[EMIT_CLABEL])); | ^~~~~~~ gvrender_core_dot.c: In function 'xdot_end_graph': ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:436:38: note: in expansion of macro 'agxbuse' 436 | agxset(g, xd->g_draw->index, agxbuse(xbufs[EMIT_GDRAW])); | ^~~~~~~ ../../lib/graph/agxbuf.h:68:11: warning: right-hand operand of comma expression has no effect [-Wunused-value] 68 | (int)(*(X)->ptr++ = ((unsigned char)C))) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../lib/graph/agxbuf.h:74:21: note: in expansion of macro 'agxbputc' 74 | #define agxbuse(X) (agxbputc(X,'\0'),(char*)((X)->ptr = (X)->buf)) | ^~~~~~~~ gvrender_core_dot.c:444:40: note: in expansion of macro 'agxbuse' 444 | agxset(g, xd->g_l_draw->index, agxbuse(xbufs[EMIT_GLABEL])); | ^~~~~~~ CC gvrender_core_fig.lo CC gvrender_core_map.lo CC gvrender_core_ps.lo CC gvrender_core_svg.lo CC gvrender_core_tk.lo gvrender_core_tk.c: In function 'tkgen_print_tags': gvrender_core_tk.c:58:18: warning: variable 'ObjId' set but not used [-Wunused-but-set-variable] 58 | unsigned int ObjId; | ^~~~~ gvrender_core_tk.c:57:21: warning: variable 'ObjPart' set but not used [-Wunused-but-set-variable] 57 | char *ObjType, *ObjPart; | ^~~~~~~ CC gvrender_core_vml.lo gvrender_core_vml.c: In function 'vml_ellipse': gvrender_core_vml.c:452:38: warning: variable 'bottom' set but not used [-Wunused-but-set-variable] 452 | double dx, dy, left, right, top, bottom; | ^~~~~~ gvrender_core_vml.c:452:26: warning: variable 'right' set but not used [-Wunused-but-set-variable] 452 | double dx, dy, left, right, top, bottom; | ^~~~~ CC gvloadimage_core.lo gvloadimage_core.c:19:22: warning: extra tokens at end of #include directive 19 | #include # for read() declaration | ^ CCLD libgvplugin_core_C.la ar: `u' modifier ignored since `D' is the default (see `U') CCLD libgvplugin_core.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/plugin/core' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz' /bin/bash ../../libtool --mode=install /usr/bin/install -c libgvplugin_core.la '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz' libtool: install: /usr/bin/install -c .libs/libgvplugin_core.lai /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_core.la libtool: install: /usr/bin/install -c .libs/libgvplugin_core.a /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_core.a libtool: install: chmod 644 /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_core.a libtool: install: ranlib /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_core.a libtool: finish: PATH="/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin:/sbin" ldconfig -n /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz ---------------------------------------------------------------------- Libraries have been installed in: /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz If you ever happen to want to link against installed libraries in a given directory, LIBDIR, you must either use libtool, and specify the full pathname of the library, or use the `-LLIBDIR' flag during linking and do at least one of the following: - add LIBDIR to the `LD_LIBRARY_PATH' environment variable during execution - add LIBDIR to the `LD_RUN_PATH' environment variable during linking - use the `-Wl,-rpath -Wl,LIBDIR' linker flag - have your system administrator add LIBDIR to `/etc/ld.so.conf' See any operating system documentation about shared libraries for more information, such as the ld(1) and ld.so(8) manual pages. ---------------------------------------------------------------------- make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/plugin/core' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/plugin/core' Making install in dot_layout make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/plugin/dot_layout' CC gvplugin_dot_layout.lo CC gvlayout_dot_layout.lo CCLD libgvplugin_dot_layout_C.la ar: `u' modifier ignored since `D' is the default (see `U') CCLD libgvplugin_dot_layout.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/plugin/dot_layout' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz' /bin/bash ../../libtool --mode=install /usr/bin/install -c libgvplugin_dot_layout.la '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz' libtool: install: /usr/bin/install -c .libs/libgvplugin_dot_layout.lai /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_dot_layout.la libtool: install: /usr/bin/install -c .libs/libgvplugin_dot_layout.a /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_dot_layout.a libtool: install: chmod 644 /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_dot_layout.a libtool: install: ranlib /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_dot_layout.a libtool: finish: PATH="/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin:/sbin" ldconfig -n /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz ---------------------------------------------------------------------- Libraries have been installed in: /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz If you ever happen to want to link against installed libraries in a given directory, LIBDIR, you must either use libtool, and specify the full pathname of the library, or use the `-LLIBDIR' flag during linking and do at least one of the following: - add LIBDIR to the `LD_LIBRARY_PATH' environment variable during execution - add LIBDIR to the `LD_RUN_PATH' environment variable during linking - use the `-Wl,-rpath -Wl,LIBDIR' linker flag - have your system administrator add LIBDIR to `/etc/ld.so.conf' See any operating system documentation about shared libraries for more information, such as the ld(1) and ld.so(8) manual pages. ---------------------------------------------------------------------- make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/plugin/dot_layout' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/plugin/dot_layout' Making install in neato_layout make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/plugin/neato_layout' CC gvplugin_neato_layout.lo CC gvlayout_neato_layout.lo CCLD libgvplugin_neato_layout_C.la ar: `u' modifier ignored since `D' is the default (see `U') CCLD libgvplugin_neato_layout.la ar: `u' modifier ignored since `D' is the default (see `U') make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/plugin/neato_layout' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz' /bin/bash ../../libtool --mode=install /usr/bin/install -c libgvplugin_neato_layout.la '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz' libtool: install: /usr/bin/install -c .libs/libgvplugin_neato_layout.lai /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_neato_layout.la libtool: install: /usr/bin/install -c .libs/libgvplugin_neato_layout.a /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_neato_layout.a libtool: install: chmod 644 /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_neato_layout.a libtool: install: ranlib /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz/libgvplugin_neato_layout.a libtool: finish: PATH="/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin:/sbin" ldconfig -n /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz ---------------------------------------------------------------------- Libraries have been installed in: /tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz If you ever happen to want to link against installed libraries in a given directory, LIBDIR, you must either use libtool, and specify the full pathname of the library, or use the `-LLIBDIR' flag during linking and do at least one of the following: - add LIBDIR to the `LD_LIBRARY_PATH' environment variable during execution - add LIBDIR to the `LD_RUN_PATH' environment variable during linking - use the `-Wl,-rpath -Wl,LIBDIR' linker flag - have your system administrator add LIBDIR to `/etc/ld.so.conf' See any operating system documentation about shared libraries for more information, such as the ld(1) and ld.so(8) manual pages. ---------------------------------------------------------------------- make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/plugin/neato_layout' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/plugin/neato_layout' make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/plugin' make[4]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/plugin' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/plugin' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/plugin' make[2]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz/plugin' make[2]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz' make[3]: Entering directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz' make[3]: Nothing to be done for 'install-exec-am'. /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/man/man7' /usr/bin/install -c -m 644 graphviz.7 '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/man/man7' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz' /usr/bin/install -c -m 644 graphviz_version.h '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz' /usr/bin/mkdir -p '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/graphviz/doc' /usr/bin/install -c -m 644 AUTHORS COPYING ChangeLog NEWS cpl1.0.txt '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/share/graphviz/doc' make[3]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz' make[2]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz' make[1]: Leaving directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/graphviz' cp: -r not specified; omitting directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/graphviz' cp: -r not specified; omitting directory '/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/lib/pkgconfig' checking for stdio.h... yes checking for stdlib.h... yes checking for string.h... yes checking for inttypes.h... yes checking for stdint.h... yes checking for strings.h... yes checking for sys/stat.h... yes checking for sys/types.h... yes checking for unistd.h... yes checking for zlib.h... yes checking for deflateBound in -lz... yes checking for library containing pow... -lm checking for _Bool... yes checking for stdbool.h that conforms to C99... yes checking for whether compiler has bool... yes configure: Using the following compilation and linking flags for Rgraphviz configure: PKG_CFLAGS= -I/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz configure: PKG_LIBS=libxdot.a libgvplugin_dot_layout.a libgvplugin_neato_layout.a libgvplugin_core.a libgvc.a libpathplan.a libgraph.a libcdt.a -lz -lm configure: GVIZ_DEFS=-DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 configure: Compiling using Graphviz version: '2.28.0'. configure: Using bundled Graphviz: 'TRUE'. configure: creating ./config.status config.status: creating R/graphviz_build_version.R config.status: creating src/Makevars ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ gcc -I"/usr/share/R/include" -DNDEBUG -I/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c LL_funcs.c -o LL_funcs.o gcc -I"/usr/share/R/include" -DNDEBUG -I/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c Rgraphviz.c -o Rgraphviz.o gcc -I"/usr/share/R/include" -DNDEBUG -I/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c RgraphvizInit.c -o RgraphvizInit.o gcc -I"/usr/share/R/include" -DNDEBUG -I/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c agopen.c -o agopen.o gcc -I"/usr/share/R/include" -DNDEBUG -I/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c agread.c -o agread.o gcc -I"/usr/share/R/include" -DNDEBUG -I/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c agwrite.c -o agwrite.o gcc -I"/usr/share/R/include" -DNDEBUG -I/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c bezier.c -o bezier.o gcc -I"/usr/share/R/include" -DNDEBUG -I/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c buildEdgeList.c -o buildEdgeList.o gcc -I"/usr/share/R/include" -DNDEBUG -I/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c buildNodeList.c -o buildNodeList.o gcc -I"/usr/share/R/include" -DNDEBUG -I/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c doLayout.c -o doLayout.o gcc -I"/usr/share/R/include" -DNDEBUG -I/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c graphvizVersion.c -o graphvizVersion.o gcc -I"/usr/share/R/include" -DNDEBUG -I/tmp/Rtmpod3hVF/R.INSTALL3567f81dbcb1c6/Rgraphviz/src/libunix/include/graphviz -DGRAPHVIZ_MAJOR=2 -DGRAPHVIZ_MINOR=28 -DGRAPHVIZ_STATIC -DHAVE_STDBOOL_H=1 -DHAVE_BOOL=1 -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c init.c -o init.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o Rgraphviz.so LL_funcs.o Rgraphviz.o RgraphvizInit.o agopen.o agread.o agwrite.o bezier.o buildEdgeList.o buildNodeList.o doLayout.o graphvizVersion.o init.o libxdot.a libgvplugin_dot_layout.a libgvplugin_neato_layout.a libgvplugin_core.a libgvc.a libpathplan.a libgraph.a libcdt.a -lz -lm -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-Rgraphviz/00new/Rgraphviz/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (Rgraphviz) * installing *source* package ‘rhdf5’ ... ** using staged installation configure: creating ./config.status config.status: creating src/external_filters.h ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ using C++ compiler: ‘g++ (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5.c -o H5.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5A.c -o H5A.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5D.c -o H5D.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5E.c -o H5E.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5F.c -o H5F.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5G.c -o H5G.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5I.c -o H5I.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5L.c -o H5L.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5O.c -o H5O.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5P.c -o H5P.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5R.c -o H5R.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5S.c -o H5S.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5S_extras.c -o H5S_extras.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5T.c -o H5T.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5T_extras.c -o H5T_extras.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5Z.c -o H5Z.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5constants.c -o H5constants.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c HandleList.cpp -o HandleList.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c HandleListWrap.c -o HandleListWrap.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c bit64conversion.c -o bit64conversion.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c external_filters.c -o external_filters.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c h5dump.c -o h5dump.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c h5ls.c -o h5ls.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c h5testLock.c -o h5testLock.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c h5writeDataFrame.c -o h5writeDataFrame.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c printdatatype.c -o printdatatype.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c utils.c -o utils.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c wrap.c -o wrap.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o rhdf5.so H5.o H5A.o H5D.o H5E.o H5F.o H5G.o H5I.o H5L.o H5O.o H5P.o H5R.o H5S.o H5S_extras.o H5T.o H5T_extras.o H5Z.o H5constants.o HandleList.o HandleListWrap.o bit64conversion.o external_filters.o h5dump.o h5ls.o h5testLock.o h5writeDataFrame.o printdatatype.o utils.o wrap.o /home/omnipath/local/R/4.3-3.18/Rhdf5lib/lib/libhdf5.a -lcrypto -lcurl -lsz -laec -lz -ldl -lm -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-rhdf5/00new/rhdf5/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (rhdf5) * installing *source* package ‘viper’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (viper) * installing *source* package ‘biocViews’ ... ** using staged installation ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (biocViews) * installing *source* package ‘bluster’ ... ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ using C++11 g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c RcppExports.cpp -o RcppExports.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c build_snn.cpp -o build_snn.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c sum_neighbor_weights.cpp -o sum_neighbor_weights.o g++ -std=gnu++11 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o bluster.so RcppExports.o build_snn.o sum_neighbor_weights.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-bluster/00new/bluster/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (bluster) * installing *source* package ‘ComplexHeatmap’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (ComplexHeatmap) * installing *source* package ‘densvis’ ... ** using non-staged installation via StagedInstall field ** libs using C++ compiler: ‘g++ (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fopenmp -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c RcppExports.cpp -o RcppExports.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fopenmp -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c densne.cpp -o densne.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fopenmp -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c densvis.cpp -o densvis.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fopenmp -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c sptree.cpp -o sptree.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o densvis.so RcppExports.o densne.o densvis.o sptree.o -llapack -lblas -lgfortran -lm -lquadmath -fopenmp -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/densvis/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded * DONE (densvis) * installing *source* package ‘GenomeInfoDb’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (GenomeInfoDb) * installing *source* package ‘S4Arrays’ ... ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_init_S4Arrays.c -o R_init_S4Arrays.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c S4Vectors_stubs.c -o S4Vectors_stubs.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c abind.c -o abind.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c array_selection.c -o array_selection.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c dim_tuning_utils.c -o dim_tuning_utils.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o S4Arrays.so R_init_S4Arrays.o S4Vectors_stubs.o abind.o array_selection.o dim_tuning_utils.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-S4Arrays/00new/S4Arrays/libs ** R ** inst ** byte-compile and prepare package for lazy loading Creating a new generic function for ‘rowsum’ in package ‘S4Arrays’ Creating a new generic function for ‘abind’ in package ‘S4Arrays’ ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (S4Arrays) * installing *source* package ‘XVector’ ... ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c IRanges_stubs.c -o IRanges_stubs.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c Ocopy_byteblocks.c -o Ocopy_byteblocks.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c RDS_random_access.c -o RDS_random_access.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_init_XVector.c -o R_init_XVector.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c S4Vectors_stubs.c -o S4Vectors_stubs.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SharedDouble_class.c -o SharedDouble_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SharedInteger_class.c -o SharedInteger_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SharedRaw_class.c -o SharedRaw_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SharedVector_class.c -o SharedVector_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c XDouble_class.c -o XDouble_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c XInteger_class.c -o XInteger_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c XRawList_comparison.c -o XRawList_comparison.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c XRaw_class.c -o XRaw_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c XVectorList_class.c -o XVectorList_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c XVector_class.c -o XVector_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c io_utils.c -o io_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c slice_methods.c -o slice_methods.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c vector_copy.c -o vector_copy.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c view_summarization_methods.c -o view_summarization_methods.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o XVector.so IRanges_stubs.o Ocopy_byteblocks.o RDS_random_access.o R_init_XVector.o S4Vectors_stubs.o SharedDouble_class.o SharedInteger_class.o SharedRaw_class.o SharedVector_class.o XDouble_class.o XInteger_class.o XRawList_comparison.o XRaw_class.o XVectorList_class.o XVector_class.o io_utils.o slice_methods.o vector_copy.o view_summarization_methods.o -lz -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-XVector/00new/XVector/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (XVector) * installing *source* package ‘BiocCheck’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (BiocCheck) * installing *source* package ‘Biostrings’ ... ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c BAB_class.c -o BAB_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c BitMatrix.c -o BitMatrix.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c IRanges_stubs.c -o IRanges_stubs.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c MIndex_class.c -o MIndex_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c PreprocessedTB_class.c -o PreprocessedTB_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_init_Biostrings.c -o R_init_Biostrings.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c RoSeqs_utils.c -o RoSeqs_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c S4Vectors_stubs.c -o S4Vectors_stubs.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SparseList_utils.c -o SparseList_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c XStringSetList_class.c -o XStringSetList_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c XStringSet_class.c -o XStringSet_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c XString_class.c -o XString_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c XVector_stubs.c -o XVector_stubs.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c align_needwunsQS.c -o align_needwunsQS.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c align_pairwiseAlignment.c -o align_pairwiseAlignment.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c align_utils.c -o align_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c find_palindromes.c -o find_palindromes.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c gtestsim.c -o gtestsim.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c inject_code.c -o inject_code.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c letter_frequency.c -o letter_frequency.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c lowlevel_matching.c -o lowlevel_matching.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c match_PWM.c -o match_PWM.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c match_pattern.c -o match_pattern.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c match_pattern_boyermoore.c -o match_pattern_boyermoore.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c match_pattern_indels.c -o match_pattern_indels.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c match_pattern_shiftor.c -o match_pattern_shiftor.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c match_pdict.c -o match_pdict.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c match_pdict_ACtree2.c -o match_pdict_ACtree2.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c match_pdict_Twobit.c -o match_pdict_Twobit.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c match_pdict_utils.c -o match_pdict_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c match_reporting.c -o match_reporting.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c matchprobes.c -o matchprobes.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c pmatchPattern.c -o pmatchPattern.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c read_fasta_files.c -o read_fasta_files.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c read_fastq_files.c -o read_fastq_files.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c replaceAt.c -o replaceAt.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c replace_letter_at.c -o replace_letter_at.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c strutils.c -o strutils.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c translate.c -o translate.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c unstrsplit_methods.c -o unstrsplit_methods.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c utils.c -o utils.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c xscat.c -o xscat.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o Biostrings.so BAB_class.o BitMatrix.o IRanges_stubs.o MIndex_class.o PreprocessedTB_class.o R_init_Biostrings.o RoSeqs_utils.o S4Vectors_stubs.o SparseList_utils.o XStringSetList_class.o XStringSet_class.o XString_class.o XVector_stubs.o align_needwunsQS.o align_pairwiseAlignment.o align_utils.o find_palindromes.o gtestsim.o inject_code.o letter_frequency.o lowlevel_matching.o match_PWM.o match_pattern.o match_pattern_boyermoore.o match_pattern_indels.o match_pattern_shiftor.o match_pdict.o match_pdict_ACtree2.o match_pdict_Twobit.o match_pdict_utils.o match_reporting.o matchprobes.o pmatchPattern.o read_fasta_files.o read_fastq_files.o replaceAt.o replace_letter_at.o strutils.o translate.o unstrsplit_methods.o utils.o xscat.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-Biostrings/00new/Biostrings/libs ** R ** data ** inst ** byte-compile and prepare package for lazy loading in method for ‘twoWayAlphabetFrequencyByQuality’ with signature ‘"QualityScaledXStringSet"’: no definition for class “QualityScaledXStringSet” Creating a new generic function for ‘strsplit’ in package ‘Biostrings’ Creating a generic function for ‘ls’ from package ‘base’ in package ‘Biostrings’ Creating a new generic function for ‘pattern’ in package ‘Biostrings’ Creating a new generic function for ‘offset’ in package ‘Biostrings’ ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (Biostrings) * installing *source* package ‘GenomicRanges’ ... ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c IRanges_stubs.c -o IRanges_stubs.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_init_GenomicRanges.c -o R_init_GenomicRanges.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c S4Vectors_stubs.c -o S4Vectors_stubs.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c transcript_utils.c -o transcript_utils.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o GenomicRanges.so IRanges_stubs.o R_init_GenomicRanges.o S4Vectors_stubs.o transcript_utils.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-GenomicRanges/00new/GenomicRanges/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (GenomicRanges) * installing *source* package ‘SparseArray’ ... ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c ExtendableJaggedArray.c -o ExtendableJaggedArray.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c IRanges_stubs.c -o IRanges_stubs.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_init_SparseArray.c -o R_init_SparseArray.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c Rvector_summarization.c -o Rvector_summarization.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c Rvector_utils.c -o Rvector_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c S4Vectors_stubs.c -o S4Vectors_stubs.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SBT_utils.c -o SBT_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SVT_SparseArray_class.c -o SVT_SparseArray_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SparseArray_Complex_methods.c -o SparseArray_Complex_methods.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SparseArray_Math_methods.c -o SparseArray_Math_methods.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SparseArray_Ops_methods.c -o SparseArray_Ops_methods.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SparseArray_abind.c -o SparseArray_abind.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SparseArray_aperm.c -o SparseArray_aperm.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SparseArray_class.c -o SparseArray_class.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SparseArray_dim_tuning.c -o SparseArray_dim_tuning.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SparseArray_subassignment.c -o SparseArray_subassignment.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SparseArray_subsetting.c -o SparseArray_subsetting.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SparseArray_summarization.c -o SparseArray_summarization.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c SparseMatrix_mult.c -o SparseMatrix_mult.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c XVector_stubs.c -o XVector_stubs.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c coerceVector2.c -o coerceVector2.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c leaf_vector_Arith.c -o leaf_vector_Arith.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c leaf_vector_Compare.c -o leaf_vector_Compare.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c leaf_vector_Logic.c -o leaf_vector_Logic.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c leaf_vector_dotprod.c -o leaf_vector_dotprod.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c leaf_vector_summarization.c -o leaf_vector_summarization.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c leaf_vector_utils.c -o leaf_vector_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c matrixStats_methods.c -o matrixStats_methods.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c randomSparseArray.c -o randomSparseArray.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c readSparseCSV.c -o readSparseCSV.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c rowsum_methods.c -o rowsum_methods.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c sparseMatrix_utils.c -o sparseMatrix_utils.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/IRanges/include' -I'/home/omnipath/local/R/4.3-3.18/XVector/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c test.c -o test.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o SparseArray.so ExtendableJaggedArray.o IRanges_stubs.o R_init_SparseArray.o Rvector_summarization.o Rvector_utils.o S4Vectors_stubs.o SBT_utils.o SVT_SparseArray_class.o SparseArray_Complex_methods.o SparseArray_Math_methods.o SparseArray_Ops_methods.o SparseArray_abind.o SparseArray_aperm.o SparseArray_class.o SparseArray_dim_tuning.o SparseArray_subassignment.o SparseArray_subsetting.o SparseArray_summarization.o SparseMatrix_mult.o XVector_stubs.o coerceVector2.o leaf_vector_Arith.o leaf_vector_Compare.o leaf_vector_Logic.o leaf_vector_dotprod.o leaf_vector_summarization.o leaf_vector_utils.o matrixStats_methods.o randomSparseArray.o readSparseCSV.o rowsum_methods.o sparseMatrix_utils.o test.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-SparseArray/00new/SparseArray/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (SparseArray) * installing *source* package ‘DelayedArray’ ... ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_init_DelayedArray.c -o R_init_DelayedArray.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c S4Vectors_stubs.c -o S4Vectors_stubs.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c compress_atomic_vector.c -o compress_atomic_vector.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o DelayedArray.so R_init_DelayedArray.o S4Vectors_stubs.o compress_atomic_vector.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-DelayedArray/00new/DelayedArray/libs ** R ** inst ** byte-compile and prepare package for lazy loading Creating a new generic function for ‘apply’ in package ‘DelayedArray’ Creating a new generic function for ‘sweep’ in package ‘DelayedArray’ Creating a new generic function for ‘scale’ in package ‘DelayedArray’ Creating a generic function for ‘dnorm’ from package ‘stats’ in package ‘DelayedArray’ Creating a generic function for ‘pnorm’ from package ‘stats’ in package ‘DelayedArray’ Creating a generic function for ‘qnorm’ from package ‘stats’ in package ‘DelayedArray’ Creating a generic function for ‘dbinom’ from package ‘stats’ in package ‘DelayedArray’ Creating a generic function for ‘pbinom’ from package ‘stats’ in package ‘DelayedArray’ Creating a generic function for ‘qbinom’ from package ‘stats’ in package ‘DelayedArray’ Creating a generic function for ‘dpois’ from package ‘stats’ in package ‘DelayedArray’ Creating a generic function for ‘ppois’ from package ‘stats’ in package ‘DelayedArray’ Creating a generic function for ‘qpois’ from package ‘stats’ in package ‘DelayedArray’ Creating a generic function for ‘dlogis’ from package ‘stats’ in package ‘DelayedArray’ Creating a generic function for ‘plogis’ from package ‘stats’ in package ‘DelayedArray’ Creating a generic function for ‘qlogis’ from package ‘stats’ in package ‘DelayedArray’ ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (DelayedArray) * installing *source* package ‘KEGGREST’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (KEGGREST) * installing *source* package ‘AnnotationDbi’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading Creating a new generic function for ‘packageName’ in package ‘AnnotationDbi’ Creating a generic function for ‘ls’ from package ‘base’ in package ‘AnnotationDbi’ Creating a generic function for ‘eapply’ from package ‘base’ in package ‘AnnotationDbi’ Creating a generic function for ‘exists’ from package ‘base’ in package ‘AnnotationDbi’ Creating a generic function for ‘sample’ from package ‘base’ in package ‘AnnotationDbi’ ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (AnnotationDbi) * installing *source* package ‘beachmat’ ... ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ using C++17 g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c RcppExports.cpp -o RcppExports.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c delayed_isometric_binary.cpp -o delayed_isometric_binary.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c delayed_isometric_math.cpp -o delayed_isometric_math.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c delayed_isometric_unary.cpp -o delayed_isometric_unary.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c delayed_other.cpp -o delayed_other.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c dense_matrix.cpp -o dense_matrix.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c fragment_sparse_rows.cpp -o fragment_sparse_rows.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c sparse_matrix.cpp -o sparse_matrix.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c tatami_utils.cpp -o tatami_utils.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I../inst/include -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c unknown_matrix.cpp -o unknown_matrix.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o beachmat.so RcppExports.o delayed_isometric_binary.o delayed_isometric_math.o delayed_isometric_unary.o delayed_other.o dense_matrix.o fragment_sparse_rows.o sparse_matrix.o tatami_utils.o unknown_matrix.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-beachmat/00new/beachmat/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (beachmat) * installing *source* package ‘DelayedMatrixStats’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (DelayedMatrixStats) * installing *source* package ‘HDF5Array’ ... ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c S4Vectors_stubs.c -o S4Vectors_stubs.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5File.c -o H5File.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c global_errmsg_buf.c -o global_errmsg_buf.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c H5DSetDescriptor.c -o H5DSetDescriptor.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c h5dimscales.c -o h5dimscales.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c uaselection.c -o uaselection.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c h5mread_helpers.c -o h5mread_helpers.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c h5mread_startscounts.c -o h5mread_startscounts.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c ChunkIterator.c -o ChunkIterator.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c h5mread_index.c -o h5mread_index.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c h5mread_sparse.c -o h5mread_sparse.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c h5mread.c -o h5mread.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c h5summarize.c -o h5summarize.o gcc -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/S4Vectors/include' -I'/home/omnipath/local/R/4.3-3.18/Rhdf5lib/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c R_init_HDF5Array.c -o R_init_HDF5Array.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o HDF5Array.so S4Vectors_stubs.o H5File.o global_errmsg_buf.o H5DSetDescriptor.o h5dimscales.o uaselection.o h5mread_helpers.o h5mread_startscounts.o ChunkIterator.o h5mread_index.o h5mread_sparse.o h5mread.o h5summarize.o R_init_HDF5Array.o /home/omnipath/local/R/4.3-3.18/Rhdf5lib/lib/libhdf5_hl.a /home/omnipath/local/R/4.3-3.18/Rhdf5lib/lib/libhdf5.a -lcrypto -lcurl -lsz -laec -lz -ldl -lm -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-HDF5Array/00new/HDF5Array/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (HDF5Array) * installing *source* package ‘ScaledMatrix’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (ScaledMatrix) * installing *source* package ‘SummarizedExperiment’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (SummarizedExperiment) * installing *source* package ‘annotate’ ... ** using staged installation ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (annotate) * installing *source* package ‘AnnotationHub’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (AnnotationHub) * installing *source* package ‘BiocSingular’ ... ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ using C++17 g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c RcppExports.cpp -o RcppExports.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c compute_scale.cpp -o compute_scale.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o BiocSingular.so RcppExports.o compute_scale.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-BiocSingular/00new/BiocSingular/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (BiocSingular) * installing *source* package ‘biomaRt’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (biomaRt) * installing *source* package ‘DESeq2’ ... ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppArmadillo/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c DESeq2.cpp -o DESeq2.o g++ -std=gnu++17 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/RcppArmadillo/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c RcppExports.cpp -o RcppExports.o g++ -std=gnu++17 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o DESeq2.so DESeq2.o RcppExports.o -llapack -lblas -lgfortran -lm -lquadmath -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-DESeq2/00new/DESeq2/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (DESeq2) * installing *source* package ‘SingleCellExperiment’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (SingleCellExperiment) * installing *source* package ‘ExperimentHub’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (ExperimentHub) * installing *source* package ‘GSEABase’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (GSEABase) * installing *source* package ‘scuttle’ ... ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ using C++11 g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c RcppExports.cpp -o RcppExports.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c cumulative_prop.cpp -o cumulative_prop.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c downsample_counts.cpp -o downsample_counts.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c fit_linear_model.cpp -o fit_linear_model.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c pool_size_factors.cpp -o pool_size_factors.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c sparse_summarize.cpp -o sparse_summarize.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c sum_counts.cpp -o sum_counts.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I../inst/include/ -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c utils.cpp -o utils.o g++ -std=gnu++11 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o scuttle.so RcppExports.o cumulative_prop.o downsample_counts.o fit_linear_model.o pool_size_factors.o sparse_summarize.o sum_counts.o utils.o -llapack -lblas -lgfortran -lm -lquadmath -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-scuttle/00new/scuttle/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (scuttle) * installing *source* package ‘AUCell’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (AUCell) * installing *source* package ‘GSVA’ ... ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c kernel_estimation.c -o kernel_estimation.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c ks_test.c -o ks_test.o gcc -I"/usr/share/R/include" -DNDEBUG -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c register_cmethods.c -o register_cmethods.o gcc -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o GSVA.so kernel_estimation.o ks_test.o register_cmethods.o -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-GSVA/00new/GSVA/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (GSVA) * installing *source* package ‘scater’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (scater) * installing *source* package ‘scran’ ... ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0’ using C++11 g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -I'/home/omnipath/local/R/4.3-3.18/BH/include' -I'/home/omnipath/local/R/4.3-3.18/dqrng/include' -I'/home/omnipath/local/R/4.3-3.18/scuttle/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c RcppExports.cpp -o RcppExports.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -I'/home/omnipath/local/R/4.3-3.18/BH/include' -I'/home/omnipath/local/R/4.3-3.18/dqrng/include' -I'/home/omnipath/local/R/4.3-3.18/scuttle/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c choose_effect_size.cpp -o choose_effect_size.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -I'/home/omnipath/local/R/4.3-3.18/BH/include' -I'/home/omnipath/local/R/4.3-3.18/dqrng/include' -I'/home/omnipath/local/R/4.3-3.18/scuttle/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c combine_rho.cpp -o combine_rho.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -I'/home/omnipath/local/R/4.3-3.18/BH/include' -I'/home/omnipath/local/R/4.3-3.18/dqrng/include' -I'/home/omnipath/local/R/4.3-3.18/scuttle/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c compute_blocked_stats.cpp -o compute_blocked_stats.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -I'/home/omnipath/local/R/4.3-3.18/BH/include' -I'/home/omnipath/local/R/4.3-3.18/dqrng/include' -I'/home/omnipath/local/R/4.3-3.18/scuttle/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c compute_residual_stats.cpp -o compute_residual_stats.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -I'/home/omnipath/local/R/4.3-3.18/BH/include' -I'/home/omnipath/local/R/4.3-3.18/dqrng/include' -I'/home/omnipath/local/R/4.3-3.18/scuttle/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c compute_rho_null.cpp -o compute_rho_null.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:152:13: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:281:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:191:13: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:191:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:321:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:321:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:322:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:218:14: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:218:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:355:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:355:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:356:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:239:14: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:239:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random/hyperexponential_distribution.hpp:29, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/random.hpp:70, from rand_custom.h:6, from compute_rho_null.cpp:3: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ compute_rho_null.cpp:33:37: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -I'/home/omnipath/local/R/4.3-3.18/BH/include' -I'/home/omnipath/local/R/4.3-3.18/dqrng/include' -I'/home/omnipath/local/R/4.3-3.18/scuttle/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c cyclone_scores.cpp -o cyclone_scores.o In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:152:13: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:281:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:191:13: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:191:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:321:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:321:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:322:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:218:14: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:218:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:355:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:355:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:356:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:239:14: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:239:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:20, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:19, from /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm.hpp:29, from cyclone_scores.cpp:4: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/algorithm/nth_element.hpp:33:5: required from ‘RandomAccessRange& boost::range::random_shuffle(RandomAccessRange&, Generator&) [with RandomAccessRange = std::vector; Generator = pcg_detail::engine, true, pcg_detail::specific_stream, pcg_detail::default_multiplier >]’ cyclone_scores.cpp:115:41: required from here /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.18/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.18/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -I'/home/omnipath/local/R/4.3-3.18/BH/include' -I'/home/omnipath/local/R/4.3-3.18/dqrng/include' -I'/home/omnipath/local/R/4.3-3.18/scuttle/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c overlap_exprs.cpp -o overlap_exprs.o g++ -std=gnu++11 -I"/usr/share/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.18/Rcpp/include' -I'/home/omnipath/local/R/4.3-3.18/beachmat/include' -I'/home/omnipath/local/R/4.3-3.18/BH/include' -I'/home/omnipath/local/R/4.3-3.18/dqrng/include' -I'/home/omnipath/local/R/4.3-3.18/scuttle/include' -fpic -g -O2 -ffile-prefix-map=/build/r-base-MHXHhT/r-base-4.3.1=. -fstack-protector-strong -Wformat -Werror=format-security -Wdate-time -D_FORTIFY_SOURCE=2 -c rand_custom.cpp -o rand_custom.o g++ -std=gnu++11 -shared -L/usr/lib/R/lib -Wl,-Bsymbolic-functions -flto=auto -ffat-lto-objects -flto=auto -Wl,-z,relro -o scran.so RcppExports.o choose_effect_size.o combine_rho.o compute_blocked_stats.o compute_residual_stats.o compute_rho_null.o cyclone_scores.o overlap_exprs.o rand_custom.o -llapack -lblas -lgfortran -lm -lquadmath -L/usr/lib/R/lib -lR installing to /home/omnipath/local/R/4.3-3.18/00LOCK-scran/00new/scran/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (scran) The downloaded source packages are in ‘/tmp/RtmpnKYSEN/downloaded_packages’ 'getOption("repos")' replaces Bioconductor standard repositories, see 'help("repositories", package = "BiocManager")' for details. Replacement repositories: CRAN: https://cloud.r-project.org Bioconductor version 3.18 (BiocManager 1.30.22), R 4.3.1 (2023-06-16) Warning message: package(s) not installed when version(s) same as or greater than current; use `force = TRUE` to re-install: 'BiocCheck' decoupleR (2.8.0 -> dd9d47ea8...) [GitHub] basilisk.... (1.14.0 -> 0a17046ab...) [GitHub] basilisk (1.14.0 -> 8014ad726...) [GitHub] Skipping 1 packages ahead of CRAN: checkmate Downloading GitHub repo saezlab/decoupleR@HEAD ── R CMD build ───────────────────────────────────────────────────────────────── * checking for file ‘/tmp/RtmpnKYSEN/remotes35065927067d2b/saezlab-decoupleR-dd9d47e/DESCRIPTION’ ... OK * preparing ‘decoupleR’: * checking DESCRIPTION meta-information ... OK * checking for LF line-endings in source and make files and shell scripts * checking for empty or unneeded directories Omitted ‘LazyData’ from DESCRIPTION * building ‘decoupleR_2.7.1.tar.gz’ * installing *source* package ‘decoupleR’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (decoupleR) Downloading GitHub repo LTLA/basilisk.utils@HEAD ── R CMD build ───────────────────────────────────────────────────────────────── * checking for file ‘/tmp/RtmpnKYSEN/remotes3506597ed3b020/LTLA-basilisk.utils-0a17046/DESCRIPTION’ ... OK * preparing ‘basilisk.utils’: * checking DESCRIPTION meta-information ... OK * checking for LF line-endings in source and make files and shell scripts * checking for empty or unneeded directories * building ‘basilisk.utils_1.13.3.tar.gz’ * installing *source* package ‘basilisk.utils’ ... ** using staged installation ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (basilisk.utils) Downloading GitHub repo LTLA/basilisk@HEAD ── R CMD build ───────────────────────────────────────────────────────────────── * checking for file ‘/tmp/RtmpnKYSEN/remotes35065912f46429/LTLA-basilisk-8014ad7/DESCRIPTION’ ... OK * preparing ‘basilisk’: * checking DESCRIPTION meta-information ... OK * checking for LF line-endings in source and make files and shell scripts * checking for empty or unneeded directories * building ‘basilisk_1.13.4.tar.gz’ * installing *source* package ‘basilisk’ ... ** using non-staged installation via StagedInstall field ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** building package indices ** installing vignettes ** testing if installed package can be loaded * DONE (basilisk) [ Finished: 2023-10-25 19:53:16 CEST ]